Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles

DOI10.1007/978-3-540-68891-4_32zbMath1143.90359OpenAlexW1624770133MaRDI QIDQ3503866

Laurence A. Wolsey, Santanu S. Dey

Publication date: 10 June 2008

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68891-4_32

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11)

Related Items (24)

Intersection cuts for single row corner relaxations ⋮ Maximal Quadratic-Free Sets ⋮ Constructing Lattice-Free Gradient Polyhedra in Dimension Two ⋮ Two row mixed-integer cuts via lifting ⋮ On the facets of mixed integer programs with two integer variables and two constraints ⋮ Multirow Intersection Cuts Based on the Infinity Norm ⋮ Unique lifting of integer variables in minimal inequalities ⋮ On the relative strength of split, triangle and quadrilateral cuts ⋮ Outer-product-free sets for polynomial optimization and oracle-based cuts ⋮ Generalized intersection cuts and a new cut generating paradigm ⋮ On the Practical Strength of Two-Row Tableau Cuts ⋮ Composite lifting of group inequalities and an application to two-row mixing inequalities ⋮ An algorithm for the separation of two-row cuts ⋮ A note on the split rank of intersection cuts ⋮ Relaxations of mixed integer sets from lattice-free polyhedra ⋮ Approximation of Corner Polyhedra with Families of Intersection Cuts ⋮ Relaxations of mixed integer sets from lattice-free polyhedra ⋮ Computing with multi-row gomory cuts ⋮ On degenerate multi-row Gomory cuts ⋮ The strength of multi-row models ⋮ On the implementation and strengthening of intersection cuts for QCQPs ⋮ On the implementation and strengthening of intersection cuts for QCQPs ⋮ Maximal quadratic-free sets ⋮ Constructing lattice-free gradient polyhedra in dimension two

Cites Work

• Unnamed Item
• Unnamed Item
• Chvátal closures for mixed integer programming problems
• Corner polyhedra and their connection with cutting planes
• T-space and cutting planes
• Some polyhedra related to combinatorial problems
• Minimal Valid Inequalities for Integer Constraints
• On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Some continuous functions related to corner polyhedra
• Some continuous functions related to corner polyhedra, II

This page was built for publication: Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles