Solving hard mixed-integer programming problems with xpress-MP: A MIPLIB 2003 case study

Richard Laundy, Michael Perregaard, Gabriel Tavares, Horia Tipi, Alkis Vazacopoulos

Research output: Contribution to journalArticlepeer-review

24 Scopus citations

Abstract

Despite the fact that no polynomial-time algorithm is known for solving mixed-integer programming (MIP) problems, there has been remarkable success in recent years in solving a wide range of difficult MIPs. In this paper, we take a look at some of the hardest problems in the MIPLIB 2003 test set and show how Xpress-MP can be used to solve some of the problems that were previously thought to be intractable.

Original languageEnglish
Pages (from-to)304-313
Number of pages10
JournalINFORMS Journal on Computing
Volume21
Issue number2
DOIs
StatePublished - Mar 2009

Keywords

  • MIPLIB 2003
  • Mixed-integer programming (MIP)
  • Software for MIP

Fingerprint

Dive into the research topics of 'Solving hard mixed-integer programming problems with xpress-MP: A MIPLIB 2003 case study'. Together they form a unique fingerprint.

Cite this