A cutting plane algorithm for a clustering problem
Mathematical Programming: Series A and B
Optimization
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
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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 two-phase local search for the K clusters with fixed cardinality problem
MACMESE'10 Proceedings of the 12th WSEAS international conference on Mathematical and computational methods in science and engineering
Hi-index | 0.00 |
In this paper we study the K clusters with fixed cardinality problem that consists in finding K clusters, where each cluster has a fixed cardinality. We propose a mixed-integer linear programming formulation and deduce valid inequalities to strengthen the linear relaxation bound. The quality of the model is tested on randomly generated instances, by using standard software, with promising results.