Pages that link to "Item:Q2883586"
From MaRDI portal
The following pages link to Numerical study of semidefinite bounds for the \(k\)-cluster problem (Q2883586):
Displaying 7 items.
- Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
- Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster (Q342176) (← 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)
- Solving \(k\)-cluster problems to optimality with semidefinite programming (Q1925793) (← links)
- New perspectives on \(k\)-support and cluster norms (Q2834484) (← links)
- Box-bisection for solving second-degree systems and the problem of clustering (Q3776505) (← links)
- Recent Advances in Constraints (Q5901712) (← links)