TY - JOUR
T1 - Solving hard mixed-integer programming problems with xpress-MP
T2 - A MIPLIB 2003 case study
AU - Laundy, Richard
AU - Perregaard, Michael
AU - Tavares, Gabriel
AU - Tipi, Horia
AU - Vazacopoulos, Alkis
PY - 2009/3
Y1 - 2009/3
N2 - 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.
AB - 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.
KW - MIPLIB 2003
KW - Mixed-integer programming (MIP)
KW - Software for MIP
UR - http://www.scopus.com/inward/record.url?scp=67649998961&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=67649998961&partnerID=8YFLogxK
U2 - 10.1287/ijoc.1080.0293
DO - 10.1287/ijoc.1080.0293
M3 - Article
AN - SCOPUS:67649998961
SN - 1091-9856
VL - 21
SP - 304
EP - 313
JO - INFORMS Journal on Computing
JF - INFORMS Journal on Computing
IS - 2
ER -