Cutting planes in combinatorics
From MaRDI portal
Publication:1068092
DOI10.1016/S0195-6698(85)80031-7zbMath0581.05015MaRDI QIDQ1068092
Publication date: 1985
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Related Items
On the complexity of cutting-plane proofs, Chvátal closures for mixed integer programming problems, Integer programs for logic constraint satisfaction, Rank inequalities and separation algorithms for packing designs and sparse triple systems., Cutting-plane proofs in polynomial space
Cites Work