Solving Hard Mixed-Integer Programming Problems with Xpress-MP: A MIPLIB 2003 Case Study
From MaRDI portal
Publication:2901067
DOI10.1287/ijoc.1080.0293zbMath1243.90149OpenAlexW2147609091MaRDI QIDQ2901067
Michael Perregaard, Gabriel Tavares, Richard S. Laundy, Horia Tipi, Alkis A. 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
Mixed integer programming (90C11) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Lifting inequalities: a framework for generating strong cuts for nonlinear programs, Coefficient strengthening: a tool for reformulating mixed-integer programs, Parallelization of the FICO Xpress-Optimizer, How much do we ``pay for using default parameters?, Book drawings of complete bipartite graphs, Reformulations in mathematical programming: automatic symmetry detection and exploitation, ParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputers, Branching on general disjunctions, Four Good Reasons to Use an Interior Point Solver Within a MIP Solver, Determining the optimal decision time of relief allocation in response to disaster via relief demand updates, Parallelization of the FICO Xpress-Optimizer, A First Implementation of ParaXpress: Combining Internal and External Parallelization to Solve MIPs on Supercomputers, MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library, Conflict-Driven Heuristics for Mixed Integer Programming
Uses Software
