Pages that link to "Item:Q2784415"
From MaRDI portal
The following pages link to Tighter linear and semidefinite relaxations for max-cut based on the Lovász-Schrijver lift-and-project procedure (Q2784415):
Displaying 14 items.
- The equivalence of semidefinite relaxations of polynomial 0-1 and \(\pm 1\) programs via scaling (Q943789) (← links)
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation (Q1019294) (← links)
- Lift and project relaxations for the matching and related polytopes (Q1421469) (← links)
- Lift-and-project cuts and perfect graphs (Q1424301) (← links)
- On a positive semidefinite relaxation of the cut polytope (Q1894508) (← links)
- Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting (Q2307758) (← links)
- On the facets of lift-and-project relaxations under graph operations (Q2448871) (← links)
- Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra (Q2462348) (← links)
- On a representation of the matching polytope via semidefinite liftings (Q2757579) (← links)
- A comprehensive analysis of polyhedral lift-and-project methods (Q2790405) (← links)
- From Graph Orientation to the Unweighted Maximum Cut (Q2817879) (← links)
- Complexity Analyses of Bienstock–Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes (Q3009747) (← links)
- Spectral bounds for the maximum cut problem (Q3632965) (← links)
- The Probable Value of the Lovász--Schrijver Relaxations for Maximum Independent Set (Q4706196) (← links)
