Design and verify: a new scheme for generating cutting-planes
From MaRDI portal
Publication:2248750
DOI10.1007/s10107-013-0645-0zbMath1300.90019OpenAlexW2161499187MaRDI QIDQ2248750
Sebastian Pokutta, Santanu S. Dey
Publication date: 27 June 2014
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-013-0645-0
Related Items
Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators, Partial hyperplane activation for generalized intersection cuts
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvàtal rank
- Lower bounds for the Chvàtal-Gomory rank in the 0/1 cube
- Chvátal closures for mixed integer programming problems
- Relations between facets of low- and high-dimensional group problems
- On cutting-plane proofs in combinatorial optimization
- Bounds on the Chvatal rank of polytopes in the 0/1-cube
- Cutting-plane proofs in polynomial space
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Edmonds polytopes and a hierarchy of combinatorial problems
- On the Matrix-Cut Rank of Polyhedra
- The Chvátal-Gomory Closure of a Strictly Convex Body
- On the Chvátal-Gomory Closure of a Compact Convex Set
- Design and Verify: A New Scheme for Generating Cutting-Planes
- Outline of an algorithm for integer solutions to linear programs
- On the Rank of Cutting-Plane Proof Systems
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Elementary closures for integer programs.
- On the rank of mixed 0,1 polyhedra.