Computational results of a semidefinite branch-and-bound algorithm for k-cluster - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Computers and Operations Research Year : 2016

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

Abstract

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.
Fichier principal
Vignette du fichier
manuscript_COR3.pdf (300.22 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and 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)

Identifiers

Cite

Nathan Krislock, Jérôme Malick, Frédéric Roupin. Computational results of a semidefinite branch-and-bound algorithm for k-cluster. Computers and Operations Research, 2016, 66, pp.153-159. ⟨10.1016/j.cor.2015.07.008⟩. ⟨hal-00717212v6⟩
861 View
644 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More