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

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

0.00 Avg rating0 Votes
Article ID: iaor201529970
Volume: 66
Issue: 4
Start Page Number: 153
End Page Number: 159
Publication Date: Feb 2016
Journal: Computers and Operations Research
Authors: , ,
Keywords: programming: branch and bound
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.

Reviews

Required fields are marked *. Your email address will not be published.