A note on the split rank of intersection cuts
From MaRDI portal
Publication:647399
DOI10.1007/s10107-009-0329-yzbMath1230.90136OpenAlexW2137155296MaRDI QIDQ647399
Publication date: 23 November 2011
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-009-0329-y
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (11)
Theoretical challenges towards cutting-plane selection ⋮ Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set ⋮ Composite lifting of group inequalities and an application to two-row mixing inequalities ⋮ Nonunique Lifting of Integer Variables in Minimal Inequalities ⋮ On the facet defining inequalities of the mixed-integer bilinear covering set ⋮ Disjunctive programming and relaxations of polyhedra ⋮ Relaxations of mixed integer sets from lattice-free polyhedra ⋮ Cutting planes from extended LP formulations ⋮ Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs ⋮ Intersection cuts for convex mixed integer programs from translated cones ⋮ Relaxations of mixed integer sets from lattice-free polyhedra
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- On the relative strength of split, triangle and quadrilateral cuts
- Cutting planes in integer and mixed integer programming
- Chvátal closures for mixed integer programming problems
- Cook, Kannan and Schrijver's example revisited
- On degenerate multi-row Gomory cuts
- Strengthening cuts for mixed integer programs
- Tight formulations for some simple mixed integer programs and convex objective integer programs
- Split closure and intersection cuts
- Polyhedra for lot-sizing with Wagner-Whitin costs
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- On the facets of mixed integer programs with two integer variables and two constraints
- Optimizing over the split closure
- Gomory cuts revisited
- A constructive characterization of the split closure of a mixed integer linear program
- Minimal Valid Inequalities for Integer Constraints
- Computing with Multi-row Gomory Cuts
- Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
- On Mixing Inequalities: Rank, Closure, and Cutting-Plane Proofs
- Disjunctive Programming
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
- Inequalities from Two Rows of a Simplex Tableau
- On the MIR Closure of Polyhedra
- Production Planning by Mixed Integer Programming
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Some continuous functions related to corner polyhedra, II
- Elementary closures for integer programs.
- Mixing mixed-integer inequalities
- On the rank of mixed 0,1 polyhedra.
This page was built for publication: A note on the split rank of intersection cuts
