Pages that link to "Item:Q4651995"

The following pages link to Subset Algebra Lift Operators for 0-1 Integer Programming (Q4651995):

Displaying 30 items.

• Tightening simple mixed-integer sets with guaranteed bounds (Q431027) (← links)
• Projecting systems of linear inequalities with binary variables (Q646699) (← links)
• Extended formulations for convex hulls of some bilinear functions (Q783025) (← links)
• The mixing-MIR set with divisible capacities (Q930344) (← links)
• Approximate formulations for 0-1 knapsack sets (Q943790) (← links)
• Intermediate integer programming representations using value disjunctions (Q951104) (← links)
• Valid inequalities for mixed integer linear programs (Q995784) (← links)
• On the polyhedral lift-and-project methods and the fractional stable set polytope (Q1015326) (← links)
• Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
• Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators (Q1662113) (← links)
• Two new reformulation convexification based hierarchies for 0-1 MIPs (Q1748458) (← links)
• Geometric proofs for convex hull defining formulations (Q1755829) (← links)
• An improved semidefinite programming relaxation for the satisfiability problem (Q1774165) (← links)
• Lift-and-project ranks and antiblocker duality (Q1886795) (← links)
• A new necessary and sufficient global optimality condition for canonical DC problems (Q1945515) (← links)
• Pitch, extension complexity, and covering problems (Q2060545) (← links)
• Set characterizations and convex extensions for geometric convex-hull proofs (Q2089779) (← links)
• Sum-of-squares hierarchy lower bounds for symmetric formulations (Q2191774) (← links)
• Strengthening convex relaxations of 0/1-sets using Boolean formulas (Q2235155) (← links)
• Tree-width and the Sherali-Adams operator (Q2386210) (← links)
• Integrality gaps for colorful matchings (Q2419586) (← links)
• Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra (Q2462348) (← links)
• Approximate fixed-rank closures of covering problems (Q2583148) (← links)
• On inequalities with bounded coefficients and pitch for the min knapsack polytope (Q2673233) (← links)
• A Comprehensive Analysis of Polyhedral Lift-and-Project Methods (Q2790405) (← links)
• Complexity Analyses of Bienstock–Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes (Q3009747) (← links)
• (Q5091238) (← links)
• Characterizing Polytopes in the 0/1-Cube with Bounded Chvátal-Gomory Rank (Q5219666) (← links)
• High Degree Sum of Squares Proofs, Bienstock--Zuckerberg Hierarchy, and Chvátal--Gomory Cuts (Q5853720) (← links)
• The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints (Q6060149) (← links)