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