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 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 sets that are different from the ones available.


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

News & Status


Apr 8, 2019 The feature extractor application and the raw data used for the selection process are now available on the Download Page.
Mar 15, 2019 Introduction of instance tags, which replace the notion of sets used so far. All instances carry a status tag, but they may also be tagged regarding special properties. In order to see all instances of a specific tag, simply click on the tag. Tags are also searchable, in order to find all instances that are labeled by both the binary and decomposition tag, as an example.
Feb 28, 2019 Release of version 5 of the Solution file as well as updates to different subsets after 3 additional instances have been solved, and 3 others have been updated.
Jan 29, 2019 Release of version 4 of the Solution file as well as updates to different subsets after 3 additional instances have been solved, and 3 others have been updated.
Jan 28, 2019 Important update of 29 instances in the collection set that were different from the MIPLIB2010 and MIPLIB2003 instances with the same name. The instance files differed from the previous MIPLIBs either within the comment section, and/or rarely represented permuted versions of the original instances. This has been corrected. All solutions or optimal/best known solutions still apply.

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.


A journal article about the selection process of MIPLIB 2017 is currently under preparation. Until it is finished, please cite this webpage.

  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 Apr 09, 2019 by Gregor Hendel
generated with R Markdown
© 2019 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)