A note on the MIR closure and basic relaxations of polyhedra

DOI10.1016/j.orl.2011.02.011zbMath1220.90071OpenAlexW1976553218MaRDI QIDQ635512

Oktay Günlük, Sanjeeb Dash, Christian Raack

Publication date: 19 August 2011

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

Full work available at URL: https://doi.org/10.1016/j.orl.2011.02.011

zbMATH Keywords

cutting planesintersection cutsmixed integer roundingsplit closureSplit cuts

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items (5)

Disjunctive programming and relaxations of polyhedra ⋮ Relaxations of mixed integer sets from lattice-free polyhedra ⋮ On the relative strength of different generalizations of split cuts ⋮ Relaxations of mixed integer sets from lattice-free polyhedra ⋮ Intersection cuts for nonlinear integer programming: convexification techniques for structured sets

Cites Work

• Unnamed Item
• MIR closures of polyhedral sets
• Chvátal closures for mixed integer programming problems
• A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
• Split closure and intersection cuts
• A recursive procedure to generate all cuts for 0-1 mixed integer programs
• Disjunctive Programming
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming

This page was built for publication: A note on the MIR closure and basic relaxations of polyhedra