Approximate fixed-rank closures of covering problems
From MaRDI portal
Publication:2583148
Recommendations
- Subset Algebra Lift Operators for 0-1 Integer Programming
- On combinatorial approximation of covering 0-1 integer programs and partial set cover
- Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs
- Approximation algorithms for covering/packing integer programs
- Approximability of Sparse Integer Programs
Cites work
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- A connection between cutting plane theory and the geometry of numbers
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Approximate fixed-rank closures of covering problems
- Cones of Matrices and Set-Functions and 0–1 Optimization
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 1757962 (Why is no real title available?)
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- On disjunctive cuts for combinatorial optimization
- On the matrix-cut rank of polyhedra.
- On the membership problem for the elementary closure of a polyhedron
- On the separation of split cuts and related inequalities
- Subset Algebra Lift Operators for 0-1 Integer Programming
- Tree-width and the Sherali-Adams operator
- When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?
Cited in
(12)- Aggregation-based cutting-planes for packing and covering integer programs
- Pitch, extension complexity, and covering problems
- Strengthening convex relaxations of 0/1-sets using Boolean formulas
- Approximate fixed-rank closures of covering problems
- On inequalities with bounded coefficients and pitch for the min knapsack polytope
- On Tensor Powers of Integer Programs
- On the membership problem for the \({0, 1/2}\)-closure
- Tightening simple mixed-integer sets with guaranteed bounds
- Subset Algebra Lift Operators for 0-1 Integer Programming
- High Degree Sum of Squares Proofs, Bienstock--Zuckerberg Hierarchy, and Chvátal--Gomory Cuts
- Primal separation and approximation for the \(\{0,1/2\}\)-closure
- Approximate formulations for 0-1 knapsack sets
This page was built for publication: Approximate fixed-rank closures of covering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583148)
