Numerical Study of Semidefinite Bounds for the k-cluster Problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Electronic Notes in Discrete Mathematics Année : 2010

Numerical Study of Semidefinite Bounds for the k-cluster Problem

Résumé

This paper deals with semidefinite bounds for the k-cluster problem, a classical NP-hard problem in combinatorial optimization. We present numerical experiments to compare the standard semidefinite bound with the new semidefinite bound of [MR09], regarding the trade-off between tightness and computing time. We show that the formulation of the semidefinite bounds has an impact on the efficiency of the numerical solvers, and that the choice of the solver depends on what we expect to get: good accuracy, cheap computational time, or a balance of both.
Fichier principal
Vignette du fichier
malick-roupin.pdf (127.99 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00609746 , version 1 (19-07-2011)

Identifiants

Citer

Jérôme Malick, Frédéric Roupin. Numerical Study of Semidefinite Bounds for the k-cluster Problem. Electronic Notes in Discrete Mathematics, 2010, 36, pp.399-406. ⟨10.1016/j.endm.2010.05.051⟩. ⟨hal-00609746⟩
477 Consultations
209 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More