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 9 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)
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (Q2397091) (← links)
- An exact semidefinite programming approach for the max-mean dispersion problem (Q2410030) (← links)
- Improved semidefinite bounding procedure for solving max-cut problems to optimality (Q2436651) (← links)
- Minimum energy configurations on a toric lattice as a quadratic assignment problem (Q2673239) (← links)
- Numerical Study of Semidefinite Bounds for the k-cluster Problem (Q2883586) (← links)
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems (Q6114924) (← links)
