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 118 articles , 1 standard article )

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

1 2 3 4 5 6 next

  1. Basso, S.; Ceselli, Alberto; Tettamanzi, Andrea: Random sampling and machine learning to understand good decompositions (2020)
  2. Kazachkov, Aleksandr M.; Nadarajah, Selvaprabu; Balas, Egon; Margot, François: Partial hyperplane activation for generalized intersection cuts (2020)
  3. Braun, Gábor; Pokutta, Sebastian; Zink, Daniel: Lazifying conditional gradient algorithms (2019)
  4. Gamrath, Gerald; Berthold, Timo; Heinz, Stefan; Winkler, Michael: Structure-driven fix-and-propagate heuristics for mixed integer programming (2019)
  5. Hojny, Christopher; Pfetsch, Marc E.: Polytopes associated with symmetry handling (2019)
  6. Neumann, Christoph; Stein, Oliver; Sudermann-Merx, Nathan: A feasible rounding approach for mixed-integer optimization problems (2019)
  7. Pfetsch, Marc E.; Rehn, Thomas: A computational comparison of symmetry handling methods for mixed integer programs (2019)
  8. Berthold, Timo: A computational study of primal heuristics inside an MI(NL)P solver (2018)
  9. Berthold, Timo; Farmer, James; Heinz, Stefan; Perregaard, Michael: Parallelization of the FICO Xpress-Optimizer (2018)
  10. Berthold, Timo; Hendel, Gregor; Koch, Thorsten: From feasibility to improvement to proof: three phases of solving mixed-integer programs (2018)
  11. Chen, Wei-Kun; Chen, Liang; Yang, Mu-Ming; Dai, Yu-Hong: Generalized coefficient strengthening cuts for mixed integer programming (2018)
  12. Miltenberger, Matthias; Ralphs, Ted; Steffy, Daniel E.: Exploring the numerics of branch-and-cut for mixed integer linear optimization (2018)
  13. Shinano, Yuji: The ubiquity generator framework: 7 years of progress in parallelizing branch-and-bound (2018)
  14. Shinano, Yuji; Berthold, Timo; Heinz, Stefan: ParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputers (2018)
  15. Alvarez, Alejandro Marcos; Louveaux, Quentin; Wehenkel, Louis: A machine learning-based approximation of strong branching (2017)
  16. Koc, Utku; Mehrotra, Sanjay: Generation of feasible integer solutions on a massively parallel computer using the feasibility pump (2017)
  17. Le Bodic, Pierre; Nemhauser, George: An abstract model for branching and its application to mixed integer programming (2017)
  18. Lodi, Andrea; Zarpellon, Giulia: On learning and branching: a survey (2017)
  19. Souza Brito, Samuel; Santos, Haroldo Gambini: Automatic integer programming reformulation using variable neighborhood search (2017)
  20. Witzig, Jakob; Berthold, Timo; Heinz, Stefan: Experiments with conflict analysis in mixed integer programming (2017)

1 2 3 4 5 6 next


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