Subset Algebra Lift Operators for 0-1 Integer Programming
From MaRDI portal
Publication:4651995
DOI10.1137/S1052623402420346zbMath1077.90041WikidataQ114847113 ScholiaQ114847113MaRDI QIDQ4651995
Bienstock, Daniel, Mark Zuckerberg
Publication date: 23 February 2005
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Related Items (30)
Lift-and-project ranks and antiblocker duality ⋮ Tree-width and the Sherali-Adams operator ⋮ Theoretical challenges towards cutting-plane selection ⋮ Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators ⋮ On inequalities with bounded coefficients and pitch for the min knapsack polytope ⋮ Integrality gaps for colorful matchings ⋮ The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints ⋮ Sum-of-squares hierarchy lower bounds for symmetric formulations ⋮ A new necessary and sufficient global optimality condition for canonical DC problems ⋮ Tightening simple mixed-integer sets with guaranteed bounds ⋮ Projecting systems of linear inequalities with binary variables ⋮ The mixing-MIR set with divisible capacities ⋮ Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra ⋮ Strengthening convex relaxations of 0/1-sets using Boolean formulas ⋮ Approximate formulations for 0-1 knapsack sets ⋮ Complexity Analyses of Bienstock–Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes ⋮ Intermediate integer programming representations using value disjunctions ⋮ 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 ⋮ Unnamed Item ⋮ A Comprehensive Analysis of Polyhedral Lift-and-Project Methods ⋮ Valid inequalities for mixed integer linear programs ⋮ On the polyhedral lift-and-project methods and the fractional stable set polytope ⋮ Characterizing Polytopes in the 0/1-Cube with Bounded Chvátal-Gomory Rank ⋮ Pitch, extension complexity, and covering problems ⋮ Extended formulations for convex hulls of some bilinear functions ⋮ Set characterizations and convex extensions for geometric convex-hull proofs ⋮ High Degree Sum of Squares Proofs, Bienstock--Zuckerberg Hierarchy, and Chvátal--Gomory Cuts ⋮ Approximate fixed-rank closures of covering problems
This page was built for publication: Subset Algebra Lift Operators for 0-1 Integer Programming
