Lower bounds for the Chvàtal-Gomory rank in the 0/1 cube
From MaRDI portal
Publication:635513
DOI10.1016/J.ORL.2011.03.001zbMATH Open1219.90106OpenAlexW2002423337MaRDI QIDQ635513FDOQ635513
Authors: Sebastian Pokutta, Gautier Stauffer 
Publication date: 19 August 2011
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2011.03.001
Recommendations
Cites Work
- Title not available (Why is that?)
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Outline of an algorithm for integer solutions to linear programs
- Edmonds polytopes and a hierarchy of combinatorial problems
- Title not available (Why is that?)
- On Cutting Planes
- On cutting-plane proofs in combinatorial optimization
- Bounds on the Chvatal rank of polytopes in the 0/1-cube
- On the Chvátal rank of polytopes in the 0/1 cube
- Small Chvátal rank
- Matroid matching: the power of local search
Cited In (10)
- On a generalization of the Chvátal-Gomory closure
- A lower bound on the Chvátal-rank of antiwebs
- Algorithms for highly symmetric linear and integer programs
- Theoretical challenges towards cutting-plane selection
- Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvàtal rank
- Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs
- Aggregation-based cutting-planes for packing and covering integer programs
- Design and verify: a new scheme for generating cutting-planes
- Reverse split rank
- Generalized Chvátal-Gomory closures for integer programs with bounds on variables
This page was built for publication: Lower bounds for the Chvàtal-Gomory rank in the 0/1 cube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q635513)
