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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish
Title of host publicationInternational Conference on Mathematical and Computational Methods in Science and Engineering - Proceedings
PublisherWorld Scientific and Engineering Academy and Society
Pages88-92
Number of pages5
ISBN (Print)9789604742431
Publication statusPublished - 1 Jan 2010
Event12th WSEAS International Conference on Mathematical and Computational Methods in Science and Engineering, MACMESE'10 - Faro, Portugal
Duration: 3 Nov 20105 Nov 2010

Conference

Conference12th WSEAS International Conference on Mathematical and Computational Methods in Science and Engineering, MACMESE'10
CountryPortugal
CityFaro
Period3/11/105/11/10

Keywords

  • Fixed cardinality
  • K clusters
  • Local search

Fingerprint Dive into the research topics of 'A two-phase local search for the K clusters with fixed cardinality problem'. Together they form a unique fingerprint.

Cite this