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

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

doi:10.1287/ijoc.1080.0293

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

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

School of Business

Research output: Contribution to journal › Article › peer-review

25 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 language	English
Pages (from-to)	304-313
Number of pages	10
Journal	INFORMS Journal on Computing
Volume	21
Issue number	2
DOIs	https://doi.org/10.1287/ijoc.1080.0293
State	Published - Mar 2009

Keywords

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

Access to Document

10.1287/ijoc.1080.0293

Cite this

@article{901839e321d84ab5b130e164441083b3,

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

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.",

keywords = "MIPLIB 2003, Mixed-integer programming (MIP), Software for MIP",

author = "Richard Laundy and Michael Perregaard and Gabriel Tavares and Horia Tipi and Alkis Vazacopoulos",

year = "2009",

month = mar,

doi = "10.1287/ijoc.1080.0293",

language = "English",

volume = "21",

pages = "304--313",

number = "2",

}

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 - https://www.scopus.com/pages/publications/67649998961

UR - https://www.scopus.com/pages/publications/67649998961#tab=citedBy

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 -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this