On the strength of Gomory mixed-integer cuts as group cuts

DOI10.1007/s10107-007-0179-4zbMath1209.90277OpenAlexW1967634210MaRDI QIDQ948966

Oktay Günlük, Sanjeeb Dash

Publication date: 16 October 2008

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-007-0179-4

zbMATH Keywords

integer programmingcutting planesmixed integer roundingcyclic group polyhedra

Mathematics Subject Classification ID

Mixed integer programming (90C11) Linear programming (90C05)

Related Items

Intersection cuts for single row corner relaxations ⋮ Two row mixed-integer cuts via lifting ⋮ Computational Experiments with Cross and Crooked Cross Cuts ⋮ A heuristic to generate rank-1 GMI cuts ⋮ On a generalization of the master cyclic group polyhedron ⋮ Relations between facets of low- and high-dimensional group problems ⋮ On the exact separation of mixed integer knapsack cuts ⋮ The aggregation closure is polyhedral for packing and covering integer programs

Uses Software

• MIPLIB
• FEASPUMP
• CLP
• MIPLIB2003

Cites Work

• Mixed-integer cuts from cyclic groups
• Corner polyhedra and their connection with cutting planes
• Cyclic group and knapsack facets
• Local branching
• On the facets of the mixed-integer knapsack polyhedron
• Valid inequalities based on the interpolation procedure
• Some polyhedra related to combinatorial problems
• Gomory cuts revisited
• The feasibility pump
• Valid inequalities based on simple mixed-integer sets
• K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau
• Two-Step MIR Inequalities for Mixed Integer Programs
• Aggregation and Mixed Integer Rounding to Solve MIPs
• Some continuous functions related to corner polyhedra
• Some continuous functions related to corner polyhedra, II
• Unnamed Item
• Unnamed Item