Pages that link to "Item:Q2996813"
From MaRDI portal
The following pages link to A semidefinite programming approach to the hypergraph minimum bisection problem (Q2996813):
Displaying 6 items.
- On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets (Q360522) (← links)
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) (← links)
- Minimum transversals of maximum matchings as approximate solutions to the bisection problem (Q1913329) (← links)
- Semidefinite programming based approaches to the break minimization problem (Q2583777) (← links)
- An Improved Semidefinite Programming Hierarchies Rounding Approximation Algorithm for Maximum Graph Bisection Problems (Q4925247) (← links)
- (Q5443138) (← links)