In response to the needs of researchers for access to real-world mixed integer programs, Robert E. Bixby, E.A. Boyd, and R.R. Indovina created in 1992 the MIPLIB, an electronically available library of both pure and mixed integer programs. Since its introduction, MIPLIB has become a standard test set used to compare the performance of mixed integer optimizers. Its availability has provided an important stimulus for researchers in this very active area. The library has now been released in its sixth edition as a collaborative effort between Arizona State University, COIN-OR, CPLEX, FICO, Gurobi, MathWorks, MIPCL, MOSEK, NUOPT, SAS, and Zuse Institute Berlin. Like the previous MIPLIB 2010, two main sets have been compiled from the submissions. The Benchmark Set contains 240 instances that are solvable by (the union of) today’s codes. For practical reasons, the benchmark instances were selected subject to various constraints regarding solvability and numerical stability. The much larger Collection Set represents a diverse selection regardless of the above, benchmark-relevant criteria. Download the instance sets as well as supplementary data, run scripts and the solution checker from our Download page.

The current maintainers of the website and its content are Ambros Gleixner and Gregor Hendel. Contributions of new solutions to open instances are always welcome, and will be made available in periodic updates of the web page. Also, we are happy to provide additional instance tags upon request.

MIPLIB 2010

This page now hosts the new MIPLIB 2017. Find its predecessor MIPLIB 2010 on our Links page.

News & Status

News

 December 19, 2019 MIPLIB 2017 celebrates its largest update so far. 10 instances have been reported solved for the first time, and another 115 instances have improving solutions. November 20, 2019 With the 1st anniversary of MIPLIB 2017, it is time for another update. 13 new solutions have been added, 5 of which on instances for which no solution was known so far. Please see the CHANGELOG for details. We would like to warmly thank all contributors of new/improving solutions for their continuous effort. Sep 30, 2019 To the start of October, we punctually release an updated version of the test script that makes it easier to run tests. Also, we release version 9 of the solution file with 4 updated incumbent solutions for following instances: circ10-3, genus-g31-8, genus-g61-25, siena1. Aug 26, 2019 Release of Version 8 of the solution file with 4 updated incumbent solutions for following instances: ivu06, ivu06-big, ds-big, t1717. Jul 12, 2019 Release of a technical report that describes the selection methodology used for MIPLIB 2017 in detail.

Status

‘Easy’ means that the instance could be solved within less than one hour using an out-of-the-box solver on standard desktop computing hardware, ‘hard’ stands for instances, that have been solved in longer runs possibly using nonstandard hardware and/or algorithms, whereas ‘open’ means, that the instance has not yet been reported solved.

Citation

An article about the selection methodology is currently under preparation. A preprint can already be accessed on Optimization Online. Until it is finished, please cite this webpage.

@Misc{miplib2017,
Title                    ={{MIPLIB} 2017},
Note                     ={http://miplib.zib.de},
Year                     ={2018},
Key                      ={miplib2017}
}

Disclaimer

Most of the data files on this site have been converted, some optimal solutions are gathered from papers and some data was typed in by hand or generated by automatic solution extraction programs. While we took every effort to make no mistakes, we cannot guarantee that everything is correct. If you find any errors or have doubts about a solution, please contact us.

Last Update Dez 19, 2019 by Gregor Hendel
generated with R Markdown