Computational results of a semidefinite branch-and-bound algorithm for k-cluster - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2014

Computational results of a semidefinite branch-and-bound algorithm for k-cluster

Résumé

This computational paper presents a method to solve k-cluster problems exactly by intersecting semidefinite and polyhedral relaxations. Our algorithm uses a generic branch-and-bound method featuring an improved semidefinite bounding procedure. Extensive numerical experiments show that this algorithm outperforms the best known methods both in time and ability to solve large instances. For the first time, numerical results are reported for k-cluster problems on unstructured graphs with 160 vertices, which is a giant step forward from the previous state-of-the-art software.
Fichier principal
Vignette du fichier
manuscript_COR2.pdf (291.04 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00717212 , version 1 (12-07-2012)
hal-00717212 , version 2 (13-07-2012)
hal-00717212 , version 3 (13-07-2012)
hal-00717212 , version 4 (13-07-2012)
hal-00717212 , version 5 (09-01-2014)
hal-00717212 , version 6 (06-02-2015)

Identifiants

  • HAL Id : hal-00717212 , version 5

Citer

Nathan Krislock, Jérôme Malick, Frédéric Roupin. Computational results of a semidefinite branch-and-bound algorithm for k-cluster. 2014. ⟨hal-00717212v5⟩
861 Consultations
641 Téléchargements

Partager

Gmail Facebook X LinkedIn More