Elementary closures for integer programs.
From MaRDI portal
Recommendations
Cites work
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- Chvátal closures for mixed integer programming problems
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Cutting planes in integer and mixed integer programming
- Disjunctive Programming
- Edmonds polytopes and a hierarchy of combinatorial problems
- scientific article; zbMATH DE number 3156817 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3545380 (Why is no real title available?)
- scientific article; zbMATH DE number 3550465 (Why is no real title available?)
- scientific article; zbMATH DE number 3559278 (Why is no real title available?)
- scientific article; zbMATH DE number 1342126 (Why is no real title available?)
- scientific article; zbMATH DE number 1102774 (Why is no real title available?)
- scientific article; zbMATH DE number 3373541 (Why is no real title available?)
- scientific article; zbMATH DE number 956840 (Why is no real title available?)
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- On Cutting Planes
- On the matrix-cut rank of polyhedra.
- On the membership problem for the elementary closure of a polyhedron
- Outline of an algorithm for integer solutions to linear programs
- Strengthening cuts for mixed integer programs
- Two Rules for Deducing Valid Inequalities for 0-1 Problems
- When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?
Cited in
(37)- On the polyhedral lift-and-project methods and the fractional stable set polytope
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
- Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
- Theoretical challenges towards cutting-plane selection
- Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints
- On the relative strength of different generalizations of split cuts
- A relax-and-cut framework for Gomory mixed-integer cuts
- Split closure and intersection cuts
- Generating valid linear inequalities for nonlinear programs via sums of squares
- Generalized Chvátal-Gomory closures for integer programs with bounds on variables
- Design and verify: a new scheme for generating cutting-planes
- RLT insights into lift-and-project closures
- On optimizing over lift-and-project closures
- On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube
- Exact MAX-2SAT solution via lift-and-project closure
- Optimizing over the split closure
- Two row mixed-integer cuts via lifting
- The cutting plane method is polynomial for perfect matchings
- Intersection Disjunctions for Reverse Convex Sets
- scientific article; zbMATH DE number 7561762 (Why is no real title available?)
- Cutting Planes and the Elementary Closure in Fixed Dimension
- DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips
- Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts
- A heuristic to generate rank-1 GMI cuts
- Lexicography and degeneracy: Can a pure cutting plane algorithm work?
- A note on the split rank of intersection cuts
- On the split closure of the periodic timetabling polytope
- Last fifty years of integer linear programming: a focus on recent practical advances
- Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts
- Aggregation of bilinear bipartite equality constraints and its application to structural model updating problem
- Branch-and-bound versus lift-and-project relaxations in combinatorial optimization
- Depth-optimized convexity cuts
- MIR closures of polyhedral sets
- Chvátal closures for mixed integer programming problems
- The mixing-MIR set with divisible capacities
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
- Valid inequalities for mixed integer linear programs
This page was built for publication: Elementary closures for integer programs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5937498)
