Numerically safe Gomory mixed-integer cuts
From MaRDI portal
Recommendations
Cited in
(23)- Testing cut generators for mixed-integer linear programming
- Computing with multi-row gomory cuts
- Last fifty years of integer linear programming: a focus on recent practical advances
- Integer programming techniques for the nurse rostering problem
- Local elimination in the traveling salesman problem
- Strengthening Gomory Mixed-Integer Cuts
- Local cuts for mixed-integer programming
- Theoretical challenges towards cutting-plane selection
- An application of Gomory cuts in number theory
- Lexicography and degeneracy: Can a pure cutting plane algorithm work?
- A hybrid branch-and-bound approach for exact rational mixed-integer programming
- On the safety of Gomory cut generators
- A heuristic to generate rank-1 GMI cuts
- Local cuts and two-period convex hull closures for big-bucket lot-sizing problems
- A computational status update for exact rational mixed integer programming
- A computational status update for exact rational mixed integer programming
- Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework
- \(\mathcal{V}\)-polyhedral disjunctive cuts
- Safe bounds in linear and mixed-integer linear programming
- A review of computation of mathematically rigorous bounds on optima of linear programs
- Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search
- An exact rational mixed-integer programming solver
- Numerically safe lower bounds for the capacitated vehicle routing problem
This page was built for publication: Numerically safe Gomory mixed-integer cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2899029)