| HAL-Inria | Publications, software ... of Inria's scientists |
Journal articles
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.
Cited literature [20 references]
https://hal.inria.fr/hal-00717212
Contributor : Nathan Krislock <>
Submitted on : Friday, February 6, 2015 - 7:20:54 PM
Last modification on : Tuesday, May 11, 2021 - 11:37:32 AM
Long-term archiving on: : Sunday, April 16, 2017 - 4:18:26 AM
Contributor : Nathan Krislock <>
Submitted on : Friday, February 6, 2015 - 7:20:54 PM
Last modification on : Tuesday, May 11, 2021 - 11:37:32 AM
Long-term archiving on: : Sunday, April 16, 2017 - 4:18:26 AM
File
manuscript_COR3.pdf
Files produced by the author(s)