Geometric proofs for convex hull defining formulations
type: Item
instance of: scholarly article
title: Geometric proofs for convex hull defining formulations
zbMATH Open document ID: 1408.90193
author: Mark Zuckerberg
published in: Operations Research Letters
publication date: 2019-01-11T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 52B55
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 7000215
zbMATH Keywords: integer programming
zbMATH Keywords: proof by picture
zbMATH Keywords: integer polytope
zbMATH Keywords: probability measure
zbMATH Keywords: lifting methods
zbMATH Keywords: convex hull
MaRDI profile type: Publication
full work available at URL: j.orl.2016.07.006
OpenAlex ID: W2468402902
Wikidata QID: Q113867745
cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs
cites work: Subset Algebra Lift Operators for 0-1 Integer Programming
cites work: On integer polytopes with few nonzero vertices
cites work: Q4537750
cites work: Cones of Matrices and Set-Functions and 0–1 Optimization
cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
DOI: 10.1016/J.ORL.2016.07.006
description: scientific article; zbMATH DE number 7000215