Cutting planes in combinatorics (Q1068092): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Edmonds polytopes and a hierarchy of combinatorial problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3844775 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Une propriété extremale des plans projectifs finis dans une classe de codes équidistants / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Outline of an algorithm for integer solutions to linear programs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3274590 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5645210 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Cutting Planes / rank | |||
Normal rank | |||
Latest revision as of 19:47, 14 June 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
0 references
