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 3 items.
- Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← 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)
