The following pages link to On Cutting Planes (Q3883904):
Displayed 25 items.
- On the complexity of cutting-plane proofs (Q580175) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Constructive characterizations of the value-function of a mixed-integer program. I (Q798260) (← links)
- Chvátal closures for mixed integer programming problems (Q922950) (← links)
- The stable set polytope of quasi-line graphs (Q949780) (← links)
- Valid inequalities for mixed integer linear programs (Q995784) (← links)
- Constructive characterizations of the value function of a mixed-integer program. II (Q1062914) (← links)
- Cutting planes in combinatorics (Q1068092) (← links)
- Polyhedral proof methods in combinatorial optimization (Q1082268) (← links)
- Representability in mixed integer programming. I: Characterization results (Q1089258) (← links)
- The Schrijver system of odd join polyhedra (Q1101352) (← links)
- On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
- The b-hull of an integer program (Q1151337) (← links)
- On total dual integrality (Q1159081) (← links)
- Two mixed integer programming formulations arising in manufacturing management (Q1262212) (← links)
- A primal dual integer programming algorithm (Q1309813) (← links)
- A recursive procedure to generate all cuts for 0-1 mixed integer programs (Q1813832) (← links)
- Cutting-plane proofs in polynomial space (Q1813835) (← links)
- On the Chvátal rank of polytopes in the 0/1 cube (Q1961231) (← links)
- Projected Chvátal-Gomory cuts for mixed integer linear programs (Q2476991) (← links)
- LP extreme points and cuts for the fixed-charge network design problem (Q3778564) (← links)
- Sensitivity theorems in integer linear programming (Q3793940) (← links)
- The value function of an integer program (Q3941194) (← links)
- Polyhedral techniques in combinatorial optimization I: Theory (Q4715790) (← links)
- Elementary closures for integer programs. (Q5937498) (← links)