Subset Algebra Lift Operators for 0-1 Integer Programming
From MaRDI portal
Recommendations
- Approximate fixed-rank closures of covering problems
- Subset Coefficient Reduction Cuts for 0/1 Mixed-Integer Programming
- Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
- On lifted cover inequalities: a new lifting procedure with unusual properties
- A comprehensive analysis of polyhedral lift-and-project methods
Cited in
(35)- On the polyhedral lift-and-project methods and the fractional stable set polytope
- Theoretical challenges towards cutting-plane selection
- Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators
- Two new reformulation convexification based hierarchies for 0-1 MIPs
- Geometric proofs for convex hull defining formulations
- An improved semidefinite programming relaxation for the satisfiability problem
- Lift-and-project ranks and antiblocker duality
- A new necessary and sufficient global optimality condition for canonical DC problems
- Pitch, extension complexity, and covering problems
- Set characterizations and convex extensions for geometric convex-hull proofs
- Strengthening convex relaxations of 0/1-sets using Boolean formulas
- Tree-width and the Sherali-Adams operator
- Integrality gaps for colorful matchings
- Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra
- Approximate fixed-rank closures of covering problems
- On inequalities with bounded coefficients and pitch for the min knapsack polytope
- A comprehensive analysis of polyhedral lift-and-project methods
- Complexity analyses of Bienstock-Zuckerberg and lasserre relaxations on the matching and stable set polytopes
- Tightening simple mixed-integer sets with guaranteed bounds
- Sum-of-squares bounds via Boolean function analysis
- Characterizing polytopes in the 0/1-cube with bounded Chvátal-Gomory rank
- High Degree Sum of Squares Proofs, Bienstock--Zuckerberg Hierarchy, and Chvátal--Gomory Cuts
- The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints
- Projecting systems of linear inequalities with binary variables
- On connections between association schemes and analyses of polyhedral and positive semidefinite lift-and-project relaxations
- On rank-monotone graph operations and minimal obstruction graphs for the Lovász-Schrijver SDP hierarchy
- Stable set polytopes with high lift-and-project ranks for the Lovász-Schrijver SPD operator
- SoS certification for symmetric quadratic functions and its connection to constrained Boolean hypercube optimization
- An initial polyhedral study of the football pool problem
- Linear programming hierarchies collapse under symmetry
- Extended formulations for convex hulls of some bilinear functions
- The mixing-MIR set with divisible capacities
- Approximate formulations for 0-1 knapsack sets
- Intermediate integer programming representations using value disjunctions
- Valid inequalities for mixed integer linear programs
This page was built for publication: Subset Algebra Lift Operators for 0-1 Integer Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4651995)
