Gomory cuts revisited

DOI10.1016/0167-6377(96)00007-7zbMath0865.90098OpenAlexW2163013568MaRDI QIDQ2564234

Egon Balas, Sebastián Ceria, N. R. Natraj, Cornuéjols, Gérard

Publication date: 6 July 1997

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(96)00007-7

zbMATH Keywords

cutting planes branch-and-cut lifting procedure Gomory's mixed integer cuts

Mathematics Subject Classification ID

Mixed integer programming (90C11) Boolean programming (90C09)

Related Items

Intersection cuts for single row corner relaxations, Integer programming techniques for the nurse rostering problem, Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints, Individuals, populations and fluid approximations: a Petri net based perspective, MIR closures of polyhedral sets, Characterization of the split closure via geometric lifting, Theoretical challenges towards cutting-plane selection, Local cuts for mixed-integer programming, Mixed-integer cuts from cyclic groups, An efficient bound-and-stopped algorithm for integer linear programs on the objective function hyperplane, Computational Experiments with Cross and Crooked Cross Cuts, Fluid approximation of Petri net models with relatively small populations, Combining and strengthening Gomory cuts, A heuristic to generate rank-1 GMI cuts, Optimal Cutting Planes from the Group Relaxations, Achieving consistency with cutting planes, Complexity of branch-and-bound and cutting planes in mixed-integer optimization, Coordinated cutting plane generation via multi-objective separation, Lexicography and degeneracy: Can a pure cutting plane algorithm work?, A note on the split rank of intersection cuts, Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs, The mixing-MIR set with divisible capacities, Classical cuts for mixed-integer programming and branch-and-cut, Lift-and-Project Cuts for Mixed Integer Convex Programs, Backdoor Branching, Solving 0-1 programming problems by a penalty approach., On the strength of Gomory mixed-integer cuts as group cuts, On the relative strength of different generalizations of split cuts, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, Progress in computational mixed integer programming -- a look back from the other side of the tipping point, A brief history of lift-and-project, Revival of the Gomory cuts in the 1990's, A survey of the operational use of ILP models, A relax-and-cut framework for Gomory mixed-integer cuts, Cutting planes in integer and mixed integer programming, Branch and cut methods for network optimization, Chvatal--Gomory--tier cuts for general integer programs, A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables, Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts, Valid inequalities for mixed integer linear programs, A note on characterizing canonical cuts using geometry, SCIP: solving constraint integer programs, On the safety of Gomory cut generators, Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems, Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation, Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems, A cutting-plane approach to mixed 0-1 stochastic integer programs, Cutting planes for integer programs with general integer variables, ProGen/\(\pi x\) -- An instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions, Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants, Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case, Combinatorial optimization: current successes and directions for the future, Valid inequalities based on simple mixed-integer sets, A geometric approach to cut-generating functions, Depth-optimized convexity cuts, Integer-programming software systems, Airline crew scheduling: state-of-the-art, Light on the infinite group relaxation. I: Foundations and taxonomy

Uses Software

MIPLIB

Cites Work