Pages that link to "Item:Q1925793"
From MaRDI portal
The following pages link to Solving \(k\)-cluster problems to optimality with semidefinite programming (Q1925793):
Displayed 4 items.
- 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)
- Improved semidefinite bounding procedure for solving max-cut problems to optimality (Q2436651) (← links)
- Numerical Study of Semidefinite Bounds for the k-cluster Problem (Q2883586) (← links)
- Semidefinite relaxations for partitioning, assignment and ordering problems (Q5917881) (← links)