Word cloud based on frequencies in instance descriptions 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 Gabriel Kressin. 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.


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

News & Status


June 22, 2020 Release of solufile version 16 with 2 new optimal solutions and 11 better incumbents!
May 24, 2020 The new solutionfile version 15 has been released with 2 new optimal solutions, and 49 better incumbents! Importantly, the Benchmark.zip now includes correctly the instances from the benchmark-v2 testset, instead of benchmark-v1.
May 19, 2020 Thiago Serra and Ryan J. O’Neil have launched their Python tool MIPLIBing to query feature data and download instances from benchmark libraries MIPLIB, QPLIB, and MINLPLib.
Mar 25, 2020 Another month, another update! This time, we have 5 additional optimal and 20 incumbent solution submissions.
February 24, 2020 With the biggest update regarding optimal solutions so far, the realease of solution file version 13 includes 15 new optimal solutions and 7 better incumbent solutions. Additionally, b1c1s1 was solved within one hour and thus moved from ‘hard’ to ‘easy’.

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


Frequencies of categories easy/hard/open

Frequencies of categories easy/hard/open

‘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.


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

  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übecke, 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}},
  institution              = {Optimization Online},
  type                     = {Technical Report},
  year                     = {2019},
  url                      = {http://www.optimization-online.org/DB_HTML/2019/07/7285.html}
  title                    ={{MIPLIB} 2017},
  note                     ={http://miplib.zib.de},
  year                     ={2018},
  key                      ={miplib2017}


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 Jun 24, 2020 by Gabriel Kressin
generated with R Markdown
© 2020 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)