Pages that link to "Item:Q1123134"
From MaRDI portal
The following pages link to On cutting-plane proofs in combinatorial optimization (Q1123134):
Displaying 40 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)
- Optimizing over the subtour polytope of the travelling salesman problem (Q803048) (← links)
- The stable set polytope of quasi-line graphs (Q949780) (← links)
- Valid inequalities for mixed integer linear programs (Q995784) (← links)
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds (Q1179735) (← links)
- The volume of relaxed Boolean-quadric and cut polytopes (Q1356562) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators (Q1662113) (← links)
- On semantic cutting planes with very small coefficients (Q1751424) (← links)
- Aggregation-based cutting-planes for packing and covering integer programs (Q1785202) (← links)
- A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set (Q1785240) (← links)
- On some polytopes contained in the 0,1 hypercube that have a small Chvátal rank (Q1801017) (← links)
- On the Chvátal rank of polytopes in the 0/1 cube (Q1961231) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II (Q2061899) (← links)
- Lattice closures of polyhedra (Q2188243) (← links)
- Design and verify: a new scheme for generating cutting-planes (Q2248750) (← links)
- On the rational polytopes with Chvátal rank 1 (Q2288183) (← links)
- Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday) (Q2373937) (← links)
- Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra (Q2462348) (← links)
- Several notes on the power of Gomory-Chvátal cuts (Q2498920) (← links)
- Lower bounds on the size of general branch-and-bound trees (Q2687056) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q2687063) (← links)
- A lower bound on the Chvátal-rank of Antiwebs (Q2840740) (← links)
- On the Chvátal-rank of Antiwebs (Q2883565) (← links)
- Rank of random half-integral polytopes — extended abstract — (Q2883588) (← links)
- On the Chvátal rank of linear relaxations of the stable set polytope (Q3002564) (← links)
- A note on the Chvátal-rank of clique family inequalities (Q3004203) (← links)
- Design and Verify: A New Scheme for Generating Cutting-Planes (Q3009757) (← links)
- On Some Polytopes Contained in the 0,1 Hypercube that Have a Small Chvátal Rank (Q3186511) (← links)
- Lower bounds for resolution and cutting plane proofs and monotone computations (Q4372917) (← links)
- Transitive packing (Q4645940) (← links)
- A simple effective heuristic for embedded mixed-integer quadratic programming (Q5207801) (← links)
- Characterizing Polytopes in the 0/1-Cube with Bounded Chvátal-Gomory Rank (Q5219666) (← links)
- On polytopes with linear rank with respect to generalizations of the split closure (Q6122082) (← links)
- Complexity of optimizing over the integers (Q6160281) (← links)
