Pages that link to "Item:Q1123134"
From MaRDI portal
The following pages link to On cutting-plane proofs in combinatorial optimization (Q1123134):
Displaying 6 items.
- Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvàtal rank (Q408442) (← links)
- Cutting planes cannot approximate some integer programs (Q453048) (← links)
- Clique problem, cutting plane proofs and communication complexity (Q456115) (← links)
- Cutting planes from extended LP formulations (Q507316) (← links)
- Lower bounds for the Chvàtal-Gomory rank in the 0/1 cube (Q635513) (← links)
- Random half-integral polytopes (Q635514) (← links)
