On the safety of Gomory cut generators

DOI10.1007/s12532-013-0057-4zbMath1305.90311OpenAlexW2053928776MaRDI QIDQ744203

Giacomo Nannicini, Cornuéjols, Gérard, Margot, François

Publication date: 6 October 2014

Published in: Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12532-013-0057-4

zbMATH Keywords

invalid cutsparameter optimization algorithmstatistically significant comparisons

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

Theoretical challenges towards cutting-plane selection, A review of computation of mathematically rigorous bounds on optima of linear programs, Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing, Numerically Safe Lower Bounds for the Capacitated Vehicle Routing Problem

Uses Software

• R
• SCIP
• MIPLIB
• CPLEX
• Cbc
• QSopt_ex
• CLP
• MIPLIB2003
• Cgl

Cites Work

• Unnamed Item
• Progress in computational mixed integer programming -- a look back from the other side of the tipping point
• SCIP: solving constraint integer programs
• Testing cut generators for mixed-integer linear programming
• Improved strategies for radial basis function methods for global optimization
• An adaptive radial basis algorithm (ARBF) for expensive black-box mixed-integer constrained global optimization
• Safe bounds in linear and mixed-integer linear programming
• Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
• MIPLIB 2003
• Exact solutions to linear programming problems
• Gomory cuts revisited
• Numerically Safe Gomory Mixed-Integer Cuts
• An Exact Rational Mixed-Integer Programming Solver
• Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems
• Integer Programming and Pricing
• A radial basis function method for global optimization