Pages that link to "Item:Q2901067"
From MaRDI portal
The following pages link to Solving hard mixed-integer programming problems with Xpress-MP: a MIPLIB 2003 case study (Q2901067):
Displaying 20 items.
- Branching on general disjunctions (Q543420) (← links)
- How much do we ``pay'' for using default parameters? (Q626650) (← links)
- Reformulations in mathematical programming: automatic symmetry detection and exploitation (Q662305) (← links)
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
- Coefficient strengthening: a tool for reformulating mixed-integer programs (Q847848) (← links)
- On solving the progressive party problem as a MIP. (Q1422363) (← links)
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library (Q2062317) (← links)
- Book drawings of complete bipartite graphs (Q2440102) (← links)
- MIPLIB 2003 (Q2466583) (← links)
- Determining the optimal decision time of relief allocation in response to disaster via relief demand updates (Q2795152) (← links)
- Mixed integer linear programming formulation techniques (Q2808240) (← links)
- Parallelization of the FICO Xpress-Optimizer (Q2819224) (← links)
- A First Implementation of ParaXpress: Combining Internal and External Parallelization to Solve MIPs on Supercomputers (Q2819235) (← links)
- Formulating a Mixed Integer Programming Problem to Improve Solvability (Q4285160) (← links)
- Parallelization of the FICO Xpress-Optimizer (Q4637828) (← links)
- ParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputers (Q4637829) (← links)
- Four Good Reasons to Use an Interior Point Solver Within a MIP Solver (Q4685752) (← links)
- Conflict-Driven Heuristics for Mixed Integer Programming (Q4995097) (← links)
- FATCOP 2.0: Advanced features in an opportunistic mixed integer programming solver (Q5959286) (← links)
- GBOML: a structure-exploiting optimization modelling language in Python (Q6585826) (← links)
