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 language | English |
---|---|
Title of host publication | International Conference on Mathematical and Computational Methods in Science and Engineering - Proceedings |
Publisher | World Scientific and Engineering Academy and Society |
Pages | 88-92 |
Number of pages | 5 |
ISBN (Print) | 9789604742431 |
Publication status | Published - 1 Jan 2010 |
Event | 12th WSEAS International Conference on Mathematical and Computational Methods in Science and Engineering, MACMESE'10 - Faro, Portugal Duration: 3 Nov 2010 → 5 Nov 2010 |
Conference
Conference | 12th WSEAS International Conference on Mathematical and Computational Methods in Science and Engineering, MACMESE'10 |
---|---|
Country/Territory | Portugal |
City | Faro |
Period | 3/11/10 → 5/11/10 |
Keywords
- Fixed cardinality
- K clusters
- Local search