Pages that link to "Item:Q2462348"

The following pages link to Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra (Q2462348):

Displayed 7 items.

• Rank of Handelman hierarchy for Max-Cut (Q408389) ‎ (← links)
• Rank bounds for a hierarchy of Lovász and Schrijver (Q498445) ‎ (← links)
• Sum-of-squares hierarchy lower bounds for symmetric formulations (Q2191774) ‎ (← links)
• Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications (Q2392765) ‎ (← 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)
• Introduction to Donaldson–Thomas and Stable Pair Invariants (Q3460695) ‎ (← links)