Unique lifting of integer variables in minimal inequalities

DOI10.1007/s10107-012-0560-9zbMath1354.90077arXiv1701.06628OpenAlexW3104546908MaRDI QIDQ378135

Amitabh Basu, Giacomo Zambelli, Michele Conforti, Manoel B. Campêlo, Cornuéjols, Gérard

Publication date: 11 November 2013

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

liftingmixed integer linear programmingminimal valid inequality

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items

Operations that Preserve the Covering Property of the Lifting Region ⋮ Monoidal strengthening and unique lifting in MIQCPs ⋮ Lifting properties of maximal lattice-free polyhedra ⋮ Nonunique Lifting of Integer Variables in Minimal Inequalities ⋮ Can Cut-Generating Functions Be Good and Efficient? ⋮ Relaxations of mixed integer sets from lattice-free polyhedra ⋮ The (not so) trivial lifting in two dimensions ⋮ Lifting convex inequalities for bipartite bilinear programs ⋮ Lifting convex inequalities for bipartite bilinear programs ⋮ When Lift-and-Project Cuts Are Different ⋮ Cut-Generating Functions for Integer Variables ⋮ A geometric approach to cut-generating functions ⋮ Light on the infinite group relaxation. I: Foundations and taxonomy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A counterexample to a conjecture of Gomory and Johnson
• Strengthening cuts for mixed integer programs
• Some polyhedra related to combinatorial problems
• Unique Minimal Liftings for Simplicial Polytopes
• Constrained Infinite Group Relaxations of MIPs
• Minimal Inequalities for an Infinite Relaxation of Integer Programs
• A Geometric Perspective on Lifting
• Minimal Valid Inequalities for Integer Constraints
• Maximal Lattice-Free Convex Sets in Linear Subspaces
• Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
• On Lifting Integer Variables in Minimal Inequalities
• Inequalities from Two Rows of a Simplex Tableau
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Some continuous functions related to corner polyhedra