MIPLIB 2017 – The Mixed Integer Programming Library

Submissions now open for MIPLIB 2024: https://miplibsubmissions.zib.de/

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.

Contact Us

The current maintainers of the website and its content are Ambros Gleixner and Mark Turner. 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.

Please send your submissions to miplibsolutions@zib.de

MIPLIB 2010

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

News & Status

News

Oct 07, 2024	Release of solufile 32 with 28 better incumbents, 1 instance updated from open to hard, and 1 instance updated from hard to easy.
Jul 18, 2024	Release of solufile 31 with 22 better incumbents, 1 instance updated from open to hard, 1 instance updated from open to easy, and 1 instance corrected from hard to open.
Jul 09, 2024	Release of solufile 30 with 18 better incumbents, and 2 instance updated from open to hard.
Jun 18, 2024	Release of solufile 29 with 6 better incumbents, and 1 instance updated from easy to hard.
Apr 17, 2024	Release of solufile 28 with 1 new optimal solution, 44 better incumbents and 30 instances updated from hard to easy. For instance pb-market-split8-70-4 we added a new optimal solution for the previously known optimal objective value.

For all news, click here, or view the complete Changelog.

Status

Frequencies of categories easy/hard/open

‘Easy’ means that the instance could be solved within less than one hour and with at most 16 threads, 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 has been published in Mathematical Programming Computation. Please cite MIPLIB 2017 as follows:

@article{
  author                   = {Gleixner, Ambros and Hendel, Gregor and Gamrath, Gerald and Achterberg, Tobias and Bastubbe, Michael and Berthold, Timo and Christophel, Philipp M. and Jarck, Kati and Koch, Thorsten and Linderoth, Jeff and L\"ubbecke, Marco and Mittelmann, Hans D. and Ozyurt, Derya and Ralphs, Ted K. and Salvagnin, Domenico and Shinano, Yuji},
  title                    = {{MIPLIB 2017: Data-Driven Compilation of the 6th Mixed-Integer Programming Library}},
  journal                  = {Mathematical Programming Computation},
  year                     = {2021},
  doi                      = {10.1007/s12532-020-00194-3},
  url                      = {https://doi.org/10.1007/s12532-020-00194-3}
}

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.