Pages that link to "Item:Q493691"
From MaRDI portal
The following pages link to Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques (Q493691):
Displaying 5 items.
- On the Lovász theta function and some variants (Q1751239) (← links)
- Simplified semidefinite and completely positive relaxations (Q1785437) (← links)
- Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting (Q2307758) (← links)
- Why Is Maximum Clique Often Easy in Practice? (Q5144801) (← links)
- On Integrality in Semidefinite Programming for Discrete Optimization (Q6130544) (← links)
