Cutting planes in combinatorics

DOI10.1016/S0195-6698(85)80031-7zbMath0581.05015MaRDI QIDQ1068092

B. George

Publication date: 1985

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

combinatorial problemsGomory's cutting plane methodChinese checkerboardpacking diamonds

Mathematics Subject Classification ID

Other designs, configurations (05B30) Lattice packing and covering (number-theoretic aspects) (11H31)

Related Items

Rank inequalities and separation algorithms for packing designs and sparse triple systems. ⋮ Chvátal closures for mixed integer programming problems ⋮ Integer programs for logic constraint satisfaction ⋮ On the complexity of cutting-plane proofs ⋮ Cutting-plane proofs in polynomial space

Cites Work

• Une propriété extremale des plans projectifs finis dans une classe de codes équidistants
• Edmonds polytopes and a hierarchy of combinatorial problems
• Outline of an algorithm for integer solutions to linear programs
• On Cutting Planes
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cutting planes in combinatorics