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

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

1 2 3 4 5 next

  1. Berthold, Timo: A computational study of primal heuristics inside an MI(NL)P solver (2018)
  2. Berthold, Timo; Hendel, Gregor; Koch, Thorsten: From feasibility to improvement to proof: three phases of solving mixed-integer programs (2018)
  3. Chen, Wei-Kun; Chen, Liang; Yang, Mu-Ming; Dai, Yu-Hong: Generalized coefficient strengthening cuts for mixed integer programming (2018)
  4. Shinano, Yuji; Berthold, Timo; Heinz, Stefan: ParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputers (2018)
  5. Alvarez, Alejandro Marcos; Louveaux, Quentin; Wehenkel, Louis: A machine learning-based approximation of strong branching (2017)
  6. Souza Brito, Samuel; Santos, Haroldo Gambini: Automatic integer programming reformulation using variable neighborhood search (2017)
  7. Witzig, Jakob; Berthold, Timo; Heinz, Stefan: Experiments with conflict analysis in mixed integer programming (2017)
  8. Fischetti, Matteo; Lodi, Andrea; Monaci, Michele; Salvagnin, Domenico; Tramontani, Andrea: Improving branch-and-cut performance by random sampling (2016)
  9. Jakob Witzig, Timo Berthold, Stefan Heinz: Experiments with Conflict Analysis in Mixed Integer Programming (2016) arXiv
  10. Shinano, Yuji; Berthold, Timo; Heinz, Stefan: A first implementation of paraxpress: combining internal and external parallelization to solve MIPs on supercomputers (2016)
  11. Bergner, Martin; Caprara, Alberto; Ceselli, Alberto; Furini, Fabio; Lübbecke, Marco E.; Malaguti, Enrico; Traversi, Emiliano: Automatic Dantzig-Wolfe reformulation of mixed integer programs (2015)
  12. Berthold, Timo; Hendel, Gregor: Shift-and-propagate (2015)
  13. Bonami, Pierre; Margot, François: Cut generation through binarization (2015)
  14. Gamrath, Gerald; Koch, Thorsten; Martin, Alexander; Miltenberger, Matthias; Weninger, Dieter: Progress in presolving for mixed integer programming (2015)
  15. Gamrath, Gerald; Melchiori, Anna; Berthold, Timo; Gleixner, Ambros M.; Salvagnin, Domenico: Branching on multi-aggregated variables (2015)
  16. Hendel, Gregor: Enhancing MIP branching decisions by using the sample variance of pseudo costs (2015)
  17. Louveaux, Quentin; Poirrier, Laurent; Salvagnin, Domenico: The strength of multi-row models (2015)
  18. Berthold, Timo: RENS. The optimal rounding (2014)
  19. Boland, Natashia; Eberhard, Andrew; Engineer, Faramroze; Fischetti, Matteo; Savelsbergh, Martin; Tsoukalas, Angelos: Boosting the feasibility pump (2014)
  20. De Santis, M.; Lucidi, S.; Rinaldi, F.: Feasibility Pump-like heuristics for mixed integer problems (2014)

1 2 3 4 5 next


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