This is a web site to post mixed integer programming instances. Most of the instances are from the paper “Noncommercial Software for Mixed Integer Linear Programming”, by Jeff Linderoth and Ted Ralphs.
This (growing) list of instances was collected by Jeff Linderoth from instances from Hans Mittelmann’s MILPlib
collection , instances submit to the NEOS Server , and other sources.
We are posting these instances here as a public service, so we can’t really guarantee to be very helpful in answering any questions you have about the instances. But feel free to ask. If you think there is an error in the table of best known bounds on solutions, or if you have a better bound, please just let us know. We’ll put it in here.
Happy MIP Solving!
Download all instances (tar file, 40MB)
Table of Problem Sizes
Table of “Best Known” Bounds on Solutions