Solving hard mixed-integer programming problems with Xpress-MP: a MIPLIB 2003 case study

DOI10.1287/IJOC.1080.0293MaRDI QIDQ2901067zbMATH OpenOpenAlexFDO

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

Publication date 28 July 2012

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.1080.0293

zbMATH Keywords

mixed-integer programming\texttt{MIPLIB}\texttt{Xpress MP}

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Mixed integer programming (90C11)

Recommendations

• MIPLIB 2003
• scientific article; zbMATH DE number 2196290
• MIP: Theory and practice -- closing the gap
• scientific article; zbMATH DE number 1206103
• Mixed integer programming computation

Cited in

(22)

• scientific article; zbMATH DE number 2196290 (Why is no real title available?)
• MIPLIB 2003
• Book drawings of complete bipartite graphs
• Parallelization of the FICO Xpress-Optimizer
• Coefficient strengthening: a tool for reformulating mixed-integer programs
• On solving the progressive party problem as a MIP.
• GBOML: a structure-exploiting optimization modelling language in Python
• Four Good Reasons to Use an Interior Point Solver Within a MIP Solver
• Conflict-Driven Heuristics for Mixed Integer Programming
• Formulating a Mixed Integer Programming Problem to Improve Solvability
• A first implementation of ParaXpress: combining internal and external parallelization to solve MIPs on supercomputers
• Mixed integer programming computation
• Lifting inequalities: a framework for generating strong cuts for nonlinear programs
• Branching on general disjunctions
• Mixed integer linear programming formulation techniques
• Parallelization of the FICO Xpress-Optimizer
• Reformulations in mathematical programming: automatic symmetry detection and exploitation
• How much do we ``pay for using default parameters?
• Determining the optimal decision time of relief allocation in response to disaster via relief demand updates
• ParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputers
• FATCOP 2.0: Advanced features in an opportunistic mixed integer programming solver
• MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library

Describes a project that uses

Uses Software

• MIPLIB2003
• XPRESS
• FEASPUMP
• MIPLIB

This page was built for publication: Solving hard mixed-integer programming problems with Xpress-MP: a MIPLIB 2003 case study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2901067)