Lower bounds for the Chvàtal-Gomory rank in the 0/1 cube
From MaRDI portal
(Redirected from Publication:635513)
Recommendations
Cites work
- scientific article; zbMATH DE number 3156817 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- Bounds on the Chvatal rank of polytopes in the 0/1-cube
- Edmonds polytopes and a hierarchy of combinatorial problems
- Matroid matching: the power of local search
- On Cutting Planes
- On cutting-plane proofs in combinatorial optimization
- On the Chvátal rank of polytopes in the 0/1 cube
- Outline of an algorithm for integer solutions to linear programs
- Small Chvátal rank
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
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)
