Nonunique Lifting of Integer Variables in Minimal Inequalities

DOI10.1137/17M1117070zbMath1411.90220arXiv1605.06686OpenAlexW2810998404WikidataQ127945041 ScholiaQ127945041MaRDI QIDQ5376544

Amitabh Basu, Joseph Paat, Santanu S. Dey

Publication date: 13 May 2019

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

cut-generating functionscutting plane theorylattice-free sets

Mathematics Subject Classification ID

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

Related Items

Maximal Quadratic-Free Sets, Monoidal strengthening and unique lifting in MIQCPs, Towards a characterization of maximal quadratic-free sets, Generating valid linear inequalities for nonlinear programs via sums of squares, Can Cut-Generating Functions Be Good and Efficient?, Lifting convex inequalities for bipartite bilinear programs, Lifting convex inequalities for bipartite bilinear programs, Maximal quadratic-free sets

Uses Software

• infinite group relaxation

Cites Work

• Unnamed Item
• Light on the infinite group relaxation. I: Foundations and taxonomy
• Unique lifting of integer variables in minimal inequalities
• Composite lifting of group inequalities and an application to two-row mixing inequalities
• A note on the split rank of intersection cuts
• On the extreme inequalities of infinite group problems
• An integer programming approach for linear programs with probabilistic constraints
• Lifting properties of maximal lattice-free polyhedra
• Lectures on algebraic topology.
• A geometric approach to cut-generating functions
• The structure of the infinite models in integer programming
• Two row mixed-integer cuts via lifting
• Unique Minimal Liftings for Simplicial Polytopes
• Convex Sets and Minimal Sublinear Functions
• Minimal Inequalities for an Infinite Relaxation of Integer Programs
• On Maximal S-Free Convex Sets
• A Geometric Perspective on Lifting
• Integer Programming
• Operations that Preserve the Covering Property of the Lifting Region
• The Mixing Set with Flows
• On Mixing Inequalities: Rank, Closure, and Cutting-Plane Proofs
• The Group-Theoretic Approach in Mixed Integer Programming
• Cut-Generating Functions
• Cut-Generating Functions and S-Free Sets
• Mixed-Integer Vertex Covers on Bipartite Graphs
• The Continuous Mixing Polyhedron
• Mixing mixed-integer inequalities