Pages that link to "Item:Q1602704"
From MaRDI portal
The following pages link to Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704):
Displayed 9 items.
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- The spherical constraint in Boolean quadratic programs (Q925238) (← 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)
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem (Q2506169) (← links)
- Cuts for mixed 0-1 conic programming (Q2571004) (← links)
- An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs (Q2643148) (← links)
- A continuation algorithm for max-cut problem (Q2644353) (← links)
- Solving semidefinite programs using preconditioned conjugate gradients (Q5460654) (← links)