Geometric proofs for convex hull defining formulations

DOI10.1016/J.ORL.2016.07.006MaRDI QIDQ1755829zbMATH OpenOpenAlexWikidataFDO

Authors 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

convex hullinteger polytopeinteger programminglifting methodsprobability measureproof by picture

Mathematics Subject Classification ID

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

Recommendations

• Disjunctive programming and relaxations of polyhedra
• Linear programming approaches to the convex hull problem in \(\mathbb{R}^ m\)
• scientific article; zbMATH DE number 1156645
• Polyhedra related to integer-convex polynomial systems
• Ap-cone sequential relaxation procedure for 0-1 integer programs

Cites work

• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Cones of Matrices and Set-Functions and 0–1 Optimization
• scientific article; zbMATH DE number 1757962 (Why is no real title available?)
• On integer polytopes with few nonzero vertices
• Subset Algebra Lift Operators for 0-1 Integer Programming

Cited in

(4)

• Set characterizations and convex extensions for geometric convex-hull proofs
• The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints
• On the numerical solution of Lasserre relaxations of unconstrained binary quadratic optimization problem
• Extended formulations for convex hulls of some bilinear functions

This page was built for publication: Geometric proofs for convex hull defining formulations

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