Nonunique lifting of integer variables in minimal inequalities

DOI10.1137/17M1117070MaRDI QIDQ5376544zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Abstract: We explore the lifting question in the context of cut-generating functions. Most of the prior literature on this question focuses on cut-generating functions that have the unique lifting property. We develop a general theory for understanding the lifting question for cut-generating functions that do not necessarily have the unique lifting property.

Recommendations

• Unique lifting of integer variables in minimal inequalities
• On lifting integer variables in minimal inequalities
• On the unique-lifting property
• A geometric perspective on lifting
• Lifting properties of maximal lattice-free polyhedra

Cites work

• A geometric approach to cut-generating functions
• A geometric perspective on lifting
• A note on the split rank of intersection cuts
• An integer programming approach for linear programs with probabilistic constraints
• Composite lifting of group inequalities and an application to two-row mixing inequalities
• Convex sets and minimal sublinear functions
• Cut-generating functions
• Cut-generating functions and S-free sets
• scientific article; zbMATH DE number 3232606 (Why is no real title available?)
• Integer Programming
• Lectures on algebraic topology.
• Lifting properties of maximal lattice-free polyhedra
• Minimal inequalities for an infinite relaxation of integer programs
• Mixed-Integer Vertex Covers on Bipartite Graphs
• Mixing mixed-integer inequalities
• On maximal S-free convex sets
• On mixing inequalities: rank, closure, and cutting-plane proofs
• On the extreme inequalities of infinite group problems
• Operations that preserve the covering property of the lifting region
• The Continuous Mixing Polyhedron
• The group-theoretic approach in mixed integer programming
• The Mixing Set with Flows
• Two row mixed-integer cuts via lifting
• Unique lifting of integer variables in minimal inequalities
• Unique minimal liftings for simplicial polytopes

Cited in

(19)

• Maximal quadratic-free sets
• Generating valid linear inequalities for nonlinear programs via sums of squares
• A geometric perspective on lifting
• Operations that preserve the covering property of the lifting region
• Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
• On lifting integer variables in minimal inequalities
• Unique lifting of integer variables in minimal inequalities
• Can cut-generating functions be good and efficient?
• Maximal quadratic-free sets
• On the unique-lifting property
• Lifting convex inequalities for bipartite bilinear programs
• Lifting convex inequalities for bipartite bilinear programs
• Monoidal strengthening and unique lifting in MIQCPs
• Towards a characterization of maximal quadratic-free sets
• Cutting planes for signomial programming
• Submodular maximization and its generalization through an intersection cut lens
• A characterization of maximal homogeneous-quadratic-free sets
• Monoidal strengthening and unique lifting in MIQCPs
• Lifting properties of maximal lattice-free polyhedra

Describes a project that uses

Uses Software

• infinite group relaxation

This page was built for publication: Nonunique lifting of integer variables in minimal inequalities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5376544)