Numerically Safe Gomory Mixed-Integer Cuts

DOI10.1287/ijoc.1090.0324zbMath1243.90135OpenAlexW2045052635MaRDI QIDQ2899029

Ricardo Fukasawa, Marcos Goycoolea, Sanjeeb Dash, William Cook

Publication date: 28 July 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1090.0324

zbMATH Keywords

integer programmingcutting plane\texttt{TSPLIB}Gomory cuts\texttt{MIPLIB 2003}\texttt{MIPLIB 3.0}

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items

Integer programming techniques for the nurse rostering problem, Theoretical challenges towards cutting-plane selection, Local cuts for mixed-integer programming, A review of computation of mathematically rigorous bounds on optima of linear programs, A heuristic to generate rank-1 GMI cuts, Numerically Safe Lower Bounds for the Capacitated Vehicle Routing Problem, Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems, Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework, Lexicography and degeneracy: Can a pure cutting plane algorithm work?, An Exact Rational Mixed-Integer Programming Solver, Testing cut generators for mixed-integer linear programming, A computational status update for exact rational mixed integer programming, A computational status update for exact rational mixed integer programming, On the safety of Gomory cut generators, A hybrid branch-and-bound approach for exact rational mixed-integer programming, Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search

Uses Software

• MIPLIB