Recommendations
Cites work
- A radial basis function method for global optimization
- Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
- An adaptive radial basis algorithm (ARBF) for expensive black-box mixed-integer constrained global optimization
- An exact rational mixed-integer programming solver
- Deterministic pivoting algorithms for constrained ranking and clustering problems
- Exact solutions to linear programming problems
- Gomory cuts revisited
- Handbook of parametric and nonparametric statistical procedures.
- Improved strategies for radial basis function methods for global optimization
- Integer Programming and Pricing
- MIPLIB 2003
- Numerically safe Gomory mixed-integer cuts
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- SCIP: solving constraint integer programs
- Safe bounds in linear and mixed-integer linear programming
- Testing cut generators for mixed-integer linear programming
Cited in
(6)- Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing
- Theoretical challenges towards cutting-plane selection
- A relax-and-cut framework for Gomory mixed-integer cuts
- A review of computation of mathematically rigorous bounds on optima of linear programs
- Numerically safe Gomory mixed-integer cuts
- Numerically safe lower bounds for the capacitated vehicle routing problem
This page was built for publication: On the safety of Gomory cut generators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744203)