Pages that link to "Item:Q1813835"
From MaRDI portal
The following pages link to Cutting-plane proofs in polynomial space (Q1813835):
Displaying 18 items.
- Cutting planes cannot approximate some integer programs (Q453048) (← links)
- On the complexity of cutting-plane proofs (Q580175) (← links)
- On the complexity of cutting-plane proofs using split cuts (Q969513) (← links)
- On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- On semantic cutting planes with very small coefficients (Q1751424) (← links)
- Design and verify: a new scheme for generating cutting-planes (Q2248750) (← links)
- Several notes on the power of Gomory-Chvátal cuts (Q2498920) (← links)
- (Q2939032) (← links)
- Design and Verify: A New Scheme for Generating Cutting-Planes (Q3009757) (← links)
- Input Proofs and Rank One Cutting Planes (Q4018154) (← links)
- Polynomially and superexponentially shorter proofs in fragments of arithmetic (Q4032866) (← links)
- (Q4234107) (← links)
- (Q4283227) (← links)
- Lower bounds for cutting planes proofs with small coefficients (Q4372903) (← links)
- (Q4601841) (← links)
- Stabbing planes (Q4993273) (← links)
- Completeness of cutting planes revisited (Q5224684) (← links)