The following pages link to Cutting planes in combinatorics (Q1068092):
Displaying 5 items.
- On the complexity of cutting-plane proofs (Q580175) (← links)
- Chvátal closures for mixed integer programming problems (Q922950) (← links)
- Integer programs for logic constraint satisfaction (Q1193860) (← links)
- Rank inequalities and separation algorithms for packing designs and sparse triple systems. (Q1401311) (← links)
- Cutting-plane proofs in polynomial space (Q1813835) (← links)
