Pages that link to "Item:Q1610658"
From MaRDI portal
The following pages link to Geometry of semidefinite Max-Cut relaxations via matrix ranks (Q1610658):
Displaying 9 items.
- Structure methods for solving the nearest correlation matrix problem (Q270046) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704) (← links)
- An improved semidefinite programming relaxation for the satisfiability problem (Q1774165) (← 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)
- An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs (Q2643148) (← links)
- A strengthened Barvinok-Pataki bound on SDP rank (Q2670438) (← links)
- On the integrality gap of the maximum-cut semidefinite programming relaxation in fixed dimension (Q5126773) (← links)