Pages that link to "Item:Q2757665"

The following pages link to On the matrix-cut rank of polyhedra. (Q2757665):

Displaying 31 items.

• Rank of Handelman hierarchy for Max-Cut (Q408389) (← links)
• Tightening simple mixed-integer sets with guaranteed bounds (Q431027) (← links)
• Rank bounds for a hierarchy of Lovász and Schrijver (Q498445) (← links)
• Random half-integral polytopes (Q635514) (← links)
• Approximate formulations for 0-1 knapsack sets (Q943790) (← links)
• On the complexity of cutting-plane proofs using split cuts (Q969513) (← 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)
• A new lift-and-project operator (Q1752818) (← links)
• Lift \& project systems performing on the partial-vertex-cover polytope (Q1989348) (← links)
• Convexification techniques for linear complementarity constraints (Q2045009) (← links)
• Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II (Q2061899) (← links)
• Sum-of-squares hierarchy lower bounds for symmetric formulations (Q2191774) (← links)
• Design and verify: a new scheme for generating cutting-planes (Q2248750) (← links)
• Tree-width and the Sherali-Adams operator (Q2386210) (← links)
• Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications (Q2392765) (← 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)
• Lower bounds on the size of general branch-and-bound trees (Q2687056) (← links)
• Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q2687063) (← 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)
• Design and Verify: A New Scheme for Generating Cutting-Planes (Q3009757) (← links)
• Approximation Limits of Linear Programs (Beyond Hierarchies) (Q3449458) (← links)
• (Q5091238) (← links)
• Elementary closures for integer programs. (Q5937498) (← links)
• Sum of Squares Bounds for the Empty Integral Hull Problem (Q6081967) (← links)
• On polytopes with linear rank with respect to generalizations of the split closure (Q6122082) (← links)
• Complexity of optimizing over the integers (Q6160281) (← links)