Pages that link to "Item:Q1925793"
From MaRDI portal
The following pages link to Solving \(k\)-cluster problems to optimality with semidefinite programming (Q1925793):
Displaying 3 items.
- Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster (Q342176) (← links)
- A hybrid three-phase approach for the Max-Mean dispersion problem (Q342328) (← links)
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods (Q359624) (← links)
