Cutting planes in combinatorics (Q1068092): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q232254 |
||
| Property / reviewed by | |||
| Property / reviewed by: David M. Bressoud / rank | |||
Revision as of 08:58, 11 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cutting planes in combinatorics |
scientific article |
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
