MIR closures of polyhedral sets
From MaRDI portal
Publication:847821
DOI10.1007/s10107-008-0225-xzbMath1184.90107OpenAlexW2155708792MaRDI QIDQ847821
Andrea Lodi, Oktay Günlük, Sanjeeb Dash
Publication date: 19 February 2010
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-008-0225-x
Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items (31)
Binary extended formulations of polyhedral mixed-integer sets ⋮ On optimizing over lift-and-project closures ⋮ On the polyhedrality of cross and quadrilateral closures ⋮ Partial hyperplane activation for generalized intersection cuts ⋮ Computational Experiments with Cross and Crooked Cross Cuts ⋮ On the enumerative nature of Gomory's dual cutting plane method ⋮ Practical strategies for generating rank-1 split cuts in mixed-integer linear programming ⋮ Continuous cutting plane algorithms in integer programming ⋮ On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube ⋮ A heuristic to generate rank-1 GMI cuts ⋮ Cut generation through binarization ⋮ Optimal Cutting Planes from the Group Relaxations ⋮ Split cuts from sparse disjunctions ⋮ Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems ⋮ Lift-and-project cuts for convex mixed integer nonlinear programs ⋮ A note on the MIR closure and basic relaxations of polyhedra ⋮ A computational study of the cutting plane tree algorithm for general mixed-integer linear programs ⋮ Relaxations of mixed integer sets from lattice-free polyhedra ⋮ On the relative strength of different generalizations of split cuts ⋮ Lattice Reformulation Cuts ⋮ Erratum to: MIR closures of polyhedral sets ⋮ A relax-and-cut framework for Gomory mixed-integer cuts ⋮ Relaxations of mixed integer sets from lattice-free polyhedra ⋮ On the complexity of cutting-plane proofs using split cuts ⋮ Equivalence between intersection cuts and the corner polyhedron ⋮ The split closure of a strictly convex body ⋮ Split cuts and extended formulations for mixed integer conic quadratic programming ⋮ Strengthened clique-family inequalities for the stable set polytope ⋮ Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants ⋮ Virtual private network design over the first Chvátal closure ⋮ On a generalization of the Chvátal-Gomory closure
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Optimizing over the first Chvátal closure
- Chvátal closures for mixed integer programming problems
- A note on the MIR closure
- Valid inequalities for mixed integer linear programs
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
- On the membership problem for the elementary closure of a polyhedron
- A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
- On the separation of split cuts and related inequalities
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Split closure and intersection cuts
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- Optimizing over the split closure
- Projected Chvátal-Gomory cuts for mixed integer linear programs
- Edmonds polytopes and a hierarchy of combinatorial problems
- Gomory cuts revisited
- A constructive characterization of the split closure of a mixed integer linear program
- Two-Step MIR Inequalities for Mixed Integer Programs
- Aggregation and Mixed Integer Rounding to Solve MIPs
- Disjunctive Programming
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing
- Elementary closures for integer programs.
- On the rank of mixed 0,1 polyhedra.
This page was built for publication: MIR closures of polyhedral sets
