Cutting planes in combinatorics (Q1068092)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Cutting planes in combinatorics |
scientific article; zbMATH DE number 3929023
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cutting planes in combinatorics |
scientific article; zbMATH DE number 3929023 |
Statements
Cutting planes in combinatorics (English)
0 references
1985
0 references
The author uses two combinatorial problems: packing diamonds into a Chinese checkerboard nd Deza's proof of a conjecture of Erdős and Lovàsz [\textit{M. Deza}, J. Comb. Theory, Ser. B, 16, 166-167 (1974; Zbl 0263.05007)] to illustrate how Gomory's cutting plane method for solving integer linear programming problems can be used to solve combinatorial problems and suggest combinatorial proofs.
0 references
packing diamonds
0 references
Chinese checkerboard
0 references
Gomory's cutting plane method
0 references
combinatorial problems
0 references
0 references
