Valid inequalities for mixed integer linear programs
From MaRDI portal
Publication:995784
DOI10.1007/s10107-006-0086-0zbMath1278.90266MaRDI QIDQ995784
Publication date: 10 September 2007
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-0086-0
Elementary closure; Polyhedra; Gomory cut; Lift-and-project; Mixed integer linear program; Mixed integer rounding; Split cut; Union of polyhedra
90C10: Integer programming
90C11: Mixed integer programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
Related Items
Compact formulations as a union of polyhedra, On the polyhedral lift-and-project methods and the fractional stable set polytope, MIPping closures: An instant survey, Integer programming solution approach for inventory‐production–distribution problems with direct shipments
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Chvátal closures for mixed integer programming problems
- A note on the MIR closure
- Compact formulations as a union of polyhedra
- Intermediate integer programming representations using value disjunctions
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
- On cutting-plane proofs in combinatorial optimization
- On the membership problem for the elementary closure of a polyhedron
- Strengthening cuts for mixed integer programs
- Factoring polynomials with rational coefficients
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Disjunctive programming: Properties of the convex hull of feasible points
- A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
- On the separation of split cuts and related inequalities
- Tight formulations for some simple mixed integer programs and convex objective integer programs
- Cutting planes from a mixed integer Farkas lemma.
- Split closure and intersection cuts
- 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
- Optimizing over the split closure
- Projected Chvátal-Gomory cuts for mixed integer linear programs
- Strong formulations of robust mixed 0-1 programming
- Some polyhedra related to combinatorial problems
- Edmonds polytopes and a hierarchy of combinatorial problems
- Gomory cuts revisited
- On the Matrix-Cut Rank of Polyhedra
- Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Optimizing over the First Chvàtal Closure
- Aggregation and Mixed Integer Rounding to Solve MIPs
- On the Value of Binary Expansions for General Mixed-Integer Linear Programs
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- On Cutting Planes
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Lectures on Polytopes
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Subset Algebra Lift Operators for 0-1 Integer Programming
- Solving Lift-and-Project Relaxations of Binary Integer Programs
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Some continuous functions related to corner polyhedra
- When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?
- The Continuous Mixing Polyhedron
- Elementary closures for integer programs.
- Mixing mixed-integer inequalities
- On the rank of mixed 0,1 polyhedra.
