Projected Chvátal-Gomory cuts for mixed integer linear programs
From MaRDI portal
Publication:2476991
DOI10.1007/s10107-006-0051-yzbMath1135.90031OpenAlexW2037426997MaRDI QIDQ2476991
Andrea Lodi, Pierre Bonami, Matteo Fischetti, Sanjeeb Dash, Cornuéjols, Gérard
Publication date: 12 March 2008
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-006-0051-y
Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts, MIPping closures: An instant survey, MIR closures of polyhedral sets, Surrogate-RLT cuts for zero-one integer programs, On optimizing over lift-and-project closures, Optimizing over the first Chvátal closure, Computational Experiments with Cross and Crooked Cross Cuts, DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips, Practical strategies for generating rank-1 split cuts in mixed-integer linear programming, Structural Investigation of Piecewise Linearized Network Flow Problems, Split cuts from sparse disjunctions, On the Chvátal-Gomory Closure of a Compact Convex Set, On the Chvátal-Gomory closure of a compact convex set, Lattice Reformulation Cuts, Optimizing over the split closure, On the exact separation of mixed integer knapsack cuts, A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set, Valid inequalities for mixed integer linear programs, Computational aspects of infeasibility analysis in mixed integer programming, Virtual private network design over the first Chvátal closure, On a generalization of the Chvátal-Gomory closure
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Chvátal closures for mixed integer programming problems
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
- On the membership problem for the elementary closure of a polyhedron
- Geometric algorithms and combinatorial optimization
- On the separation of split cuts and related inequalities
- Optimal labeling of point features in rectangular labeling models
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- A connection between cutting plane theory and the geometry of numbers
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Edmonds polytopes and a hierarchy of combinatorial problems
- Outline of an algorithm for integer solutions to linear programs
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Optimizing over the First Chvàtal Closure
- Aggregation and Mixed Integer Rounding to Solve MIPs
- On Cutting Planes
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- On the MIR Closure of Polyhedra
- On the rank of mixed 0,1 polyhedra.
