Geometric proofs for convex hull defining formulations

DOI10.1016/j.orl.2016.07.006zbMath1408.90193OpenAlexW2468402902WikidataQ113867745 ScholiaQ113867745MaRDI QIDQ1755829

Mark Zuckerberg

Publication date: 11 January 2019

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2016.07.006

zbMATH Keywords

integer programmingconvex hullprobability measureinteger polytopelifting methodsproof by picture

Mathematics Subject Classification ID

Integer programming (90C10) Computational aspects related to convexity (52B55) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints, Extended formulations for convex hulls of some bilinear functions, Set characterizations and convex extensions for geometric convex-hull proofs

Cites Work

• Unnamed Item
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• On integer polytopes with few nonzero vertices
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• Cones of Matrices and Set-Functions and 0–1 Optimization
• Subset Algebra Lift Operators for 0-1 Integer Programming