Pages that link to "Item:Q5906394"
From MaRDI portal
The following pages link to Semidefinite programming and combinatorial optimization (Q5906394):
Displaying 10 items.
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Semi-definite relaxation algorithm of multiple knapsack problem (Q698390) (← links)
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← links)
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704) (← links)
- Approximation algorithm for MAX DICUT with given sizes of parts (Q1879136) (← links)
- SDP-based bounds for graph partition via extended ADMM (Q2125076) (← links)
- A novel formulation of the max-cut problem and related algorithm (Q2287710) (← links)
- Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation (Q2475315) (← links)
- Semidefinite spectral clustering (Q2507069) (← links)
- Solving graph equipartition SDPs on an algebraic variety (Q6120843) (← links)
