Geometric proofs for convex hull defining formulations (Q1755829): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q113867745, #quickstatements; #temporary_batch_1712111774907 |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Subset Algebra Lift Operators for 0-1 Integer Programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On integer polytopes with few nonzero vertices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4537750 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cones of Matrices and Set-Functions and 0–1 Optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank | |||
Normal rank |
Latest revision as of 20:49, 17 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Geometric proofs for convex hull defining formulations |
scientific article |
Statements
Geometric proofs for convex hull defining formulations (English)
0 references
11 January 2019
0 references
integer programming
0 references
proof by picture
0 references
integer polytope
0 references
probability measure
0 references
lifting methods
0 references
convex hull
0 references