Pages that link to "Item:Q2757579"

The following pages link to On a Representation of the Matching Polytope Via Semidefinite Liftings (Q2757579):

Displaying 18 items.

• Rank of Handelman hierarchy for Max-Cut (Q408389) (← links)
• Rank bounds for a hierarchy of Lovász and Schrijver (Q498445) (← links)
• On the polyhedral lift-and-project methods and the fractional stable set polytope (Q1015326) (← links)
• Lift and project relaxations for the matching and related polytopes (Q1421469) (← links)
• Sum-of-squares rank upper bounds for matching problems (Q1631641) (← links)
• Strong reductions for extended formulations (Q1801022) (← links)
• Sum-of-squares hierarchy lower bounds for symmetric formulations (Q2191774) (← links)
• Sherali-Adams relaxations of graph isomorphism polytopes (Q2339812) (← links)
• Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications (Q2392765) (← 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)
• On the commutativity of antiblocker diagrams under lift-and-project operators (Q2500533) (← links)
• On extracting maximum stable sets in perfect graphs using Lovász's theta function (Q2506178) (← links)
• Small Chvátal rank (Q2638380) (← links)
• A Comprehensive Analysis of Polyhedral Lift-and-Project Methods (Q2790405) (← links)
• Sum-of-Squares Rank Upper Bounds for Matching Problems (Q2835696) (← links)
• Complexity Analyses of Bienstock–Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes (Q3009747) (← links)
• (Q5708498) (← links)