MIPping closures: An instant survey
From MaRDI portal
Publication:2373443
Recommendations
Cites work
- A new ILP-based refinement heuristic for vehicle routing problems
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- Chvátal closures for mixed integer programming problems
- Edmonds polytopes and a hierarchy of combinatorial problems
- Geometric algorithms and combinatorial optimization
- scientific article; zbMATH DE number 3373541 (Why is no real title available?)
- Lift-and-project for mixed 0-1 programming: recent progress
- Local branching
- MIPLIB 2003
- On the membership problem for the elementary closure of a polyhedron
- On the MIR Closure of Polyhedra
- On the rank of mixed 0,1 polyhedra.
- On the separation of split cuts and related inequalities
- Optimizing over the First Chvàtal Closure
- Optimizing over the split closure
- Outline of an algorithm for integer solutions to linear programs
- Projected Chvátal-Gomory cuts for mixed integer linear programs
- The Homotopy Principle and Algorithms for Linear Programming
- Valid inequalities for mixed integer linear programs
Cited in
(3)
This page was built for publication: MIPping closures: An instant survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373443)