This is a collection of data representing instances of various problems from Mathematical Programming and related fields, it may be useful for performance tests on newly implemented algorithms. The following problem areas are covered:

• Assignment
• Integer and Mixed Integer Programming
• Linear Programming
• Matching
• Matrix Decomposition (MADLIB)
• Maximum Flow in directed and undirected graphs
• Minimum Cost Flow and Transportation
• Min-Cut Clustering
• Set Partitioning
• Steiner Tree Packing (Steinlib)
• Traveling Salesman (TSPLIB)
• Capacitated Vehicle Routing (VRPLIB)

Additional Resources

• Instance generating codes
• References to other MP data collections