Approximate fixed-rank closures of covering problems
From MaRDI portal
Publication:2583148
DOI10.1007/s10107-005-0598-zzbMath1085.90031MaRDI QIDQ2583148
Mark Zuckerberg, Bienstock, Daniel
Publication date: 13 January 2006
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-005-0598-z
90C10: Integer programming
Related Items
On the membership problem for the \({0, 1/2}\)-closure, Tightening simple mixed-integer sets with guaranteed bounds, Approximate formulations for 0-1 knapsack sets, Aggregation-based cutting-planes for packing and covering integer programs, Approximate fixed-rank closures of covering problems
Cites Work
- Unnamed Item
- Unnamed Item
- On the membership problem for the elementary closure of a polyhedron
- On the separation of split cuts and related inequalities
- A connection between cutting plane theory and the geometry of numbers
- Tree-width and the Sherali-Adams operator
- Approximate fixed-rank closures of covering problems
- On the Matrix-Cut Rank of Polyhedra
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- Subset Algebra Lift Operators for 0-1 Integer Programming
- When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- On disjunctive cuts for combinatorial optimization
