A two-phase local search for the K clusters with fixed cardinality problem

Authors:
Graça Marques Gonçalves;Lídia Lampreia Lourenço;Margarida Vaz Pato
Affiliations:
Universidade Nova de Lisboa, FCT, Departamento de Matemática, Universidade de Lisboa, Centro de Investigação Operacional, Monte da Caparica, Caparica, Portugal;Universidade Nova de Lisboa, FCT, Departamento de Matemática, Universidade de Lisboa, Centro de Investigação Operacional, Monte da Caparica, Caparica, Portugal;Universidade Técnica de Lisboa, ISEG, Departamento de Matemática, Universidade de Lisboa, Centro de Investigação Operacional, Lisboa, Portugal
Venue:
MACMESE'10 Proceedings of the 12th WSEAS international conference on Mathematical and computational methods in science and engineering
Year:
2010

Citing 4
Cited 0

Cluster analysis and mathematical programming

Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
A local search approximation algorithm for k-means clustering

Computational Geometry: Theory and Applications - Special issue on the 18th annual symposium on computational geometry—SoCG2002
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints

Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
A strengthened mixed-integer linear formulation for the K clusters problem with fixed cardinality

MATH'09 Proceedings of the 14th WSEAS International Conference on Applied mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a two-phase local search procedure to obtain a feasible solution for the K clusters with fixed cardinality problem. In order to evaluate the performance of this local search procedure for this NP-hard problem, a computational experiment is designed to compare the cost of the computed feasible solution either with the optimum value, or with the upper bounds obtained from the linear relaxation of a strengthened mixed-integer linear formulation defined for this problem, by using a standard software.