Improved semidefinite branch-and-bound algorithm for k-cluster
Résumé
This paper presents a method to solve k-cluster problems by intersecting semidefinite and polyhedral relaxations. We use a generic branch-and-bound method featuring an improved semidefinite bounding procedure. Extensive numerical experiments show that our algorithm outperforms the best known methods in both time and ability to solve large instances. For the first time, numerical results are reported for k-cluster problems on unstructured graphs with 140 and 160 vertices.
Origine | Fichiers produits par l'(les) auteur(s) |
---|