MIPLIB2003

MIPLIB - Mixed Integer Problem Library: In response to the needs of researchers for access to real-world mixed integer programs a group of researchers 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. This was updated in 1996 by Robert E. Bixby, Sebastian Ceria, Cassandra M. McZeal, and Martin W.P. Savelsbergh. 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. MIPLIB 2003: More than 7 years have past since the last update of the MIPLIB. And again improvements in state-of-the-art optimizers, as well as improvements in computing machinery have made several instances too easy to be of further interest. Therefore we have purged the library of those instance and filled the free slots with more worthy candidates. As the instances also the maintainers and the host of the MIPLIB have changed.


References in zbMATH (referenced in 128 articles , 1 standard article )

Showing results 1 to 20 of 128.
Sorted by year (citations)

1 2 3 ... 5 6 7 next

  1. Hendel, Gregor: Adaptive large neighborhood search for mixed integer programming (2022)
  2. Hendel, Gregor; Anderson, Daniel; Le Bodic, Pierre; Pfetsch, Marc E.: Estimating the size of branch-and-bound trees (2022)
  3. Gleixner, Ambros; Hendel, Gregor; Gamrath, Gerald; Achterberg, Tobias; Bastubbe, Michael; Berthold, Timo; Christophel, Philipp; Jarck, Kati; Koch, Thorsten; Linderoth, Jeff; Lübbecke, Marco; Mittelmann, Hans D.; Ozyurt, Derya; Ralphs, Ted K.; Salvagnin, Domenico; Shinano, Yuji: MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library (2021)
  4. Witzig, Jakob; Gleixner, Ambros: Conflict-driven heuristics for mixed integer programming (2021)
  5. Balas, Egon; Serra, Thiago: When lift-and-project cuts are different (2020)
  6. Basso, S.; Ceselli, Alberto; Tettamanzi, Andrea: Random sampling and machine learning to understand good decompositions (2020)
  7. Fukasawa, Ricardo; Poirrier, Laurent; Yang, Shenghao: Split cuts from sparse disjunctions (2020)
  8. Gamrath, Gerald; Berthold, Timo; Salvagnin, Domenico: An exploratory computational analysis of dual degeneracy in mixed-integer programming (2020)
  9. Kazachkov, Aleksandr M.; Nadarajah, Selvaprabu; Balas, Egon; Margot, François: Partial hyperplane activation for generalized intersection cuts (2020)
  10. Braun, Gábor; Pokutta, Sebastian; Zink, Daniel: Lazifying conditional gradient algorithms (2019)
  11. Gamrath, Gerald; Berthold, Timo; Heinz, Stefan; Winkler, Michael: Structure-driven fix-and-propagate heuristics for mixed integer programming (2019)
  12. Hojny, Christopher; Pfetsch, Marc E.: Polytopes associated with symmetry handling (2019)
  13. Neumann, Christoph; Stein, Oliver; Sudermann-Merx, Nathan: A feasible rounding approach for mixed-integer optimization problems (2019)
  14. Pfetsch, Marc E.; Rehn, Thomas: A computational comparison of symmetry handling methods for mixed integer programs (2019)
  15. Bastubbe, Michael; Lübbecke, Marco E.; Witt, Jonas T.: A computational investigation on the strength of Dantzig-Wolfe reformulations (2018)
  16. Berthold, Timo: A computational study of primal heuristics inside an MI(NL)P solver (2018)
  17. Berthold, Timo; Farmer, James; Heinz, Stefan; Perregaard, Michael: Parallelization of the FICO Xpress-Optimizer (2018)
  18. Berthold, Timo; Hendel, Gregor; Koch, Thorsten: From feasibility to improvement to proof: three phases of solving mixed-integer programs (2018)
  19. Chen, Wei-Kun; Chen, Liang; Yang, Mu-Ming; Dai, Yu-Hong: Generalized coefficient strengthening cuts for mixed integer programming (2018)
  20. Khaniyev, Taghi; Elhedhli, Samir; Erenay, Fatih Safa: Structure detection in mixed-integer programs (2018)

1 2 3 ... 5 6 7 next


Further publications can be found at: http://miplib.zib.de/miplib2003/biblio.html