Optimal Cutting Planes from the Group Relaxations

DOI10.1287/moor.2018.0964zbMath1437.90106arXiv1710.07672OpenAlexW2964255797MaRDI QIDQ5108238

Marco Di Summa, Michele Conforti, Amitabh Basu, Giacomo Zambelli

Publication date: 30 April 2020

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.07672

zbMATH Keywords

cutting planescut-generating functionsGomory-Johnson infinite relaxation

Mathematics Subject Classification ID

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

Related Items

Gaining or losing perspective, Strong IP formulations need large coefficients

Uses Software

• infinite group relaxation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Light on the infinite group relaxation. I: Foundations and taxonomy
• MIR closures of polyhedral sets
• T-space and cutting planes
• A geometric approach to cut-generating functions
• The structure of the infinite models in integer programming
• Optimizing over the split closure
• Some polyhedra related to combinatorial problems
• Gomory cuts revisited
• Outline of an algorithm for integer solutions to linear programs
• On products of sets in a locally compact group
• ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
• A finiteness proof for modified dantzig cuts in integer programming
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Technical Note—Strengthened Dantzig Cuts for Integer Programming
• Some continuous functions related to corner polyhedra
• Some continuous functions related to corner polyhedra, II