We introduce an iterative algorithm for the solution of the diameter minimization clustering problem (DMCP). Our algorithm is based upon two observations: 1)...

Clustering is a data mining method which consists in partitioning a given set of n objects into p clusters in order to minimize the dissimilarity among o...

Finding communities, or clusters, in networks, or graphs, has been the subject of intense studies in the last ten years. The most used criterion for that pu...

The objective in the continuous facility location problem with limited distances is to minimize the sum of distance functions from the facility to the cust...

Normalized cut is one of the most popular graph clustering criteria. The main approaches proposed for its resolution are spectral clustering methods (e.g. [1...

Finding modules, or clusters, in networks currently attracts much attention in several domains. The most studied criterion for doing so, due to Newman and Gi...

Given a set of entities associated with points in Euclidean space, minimum sum-of-squares clustering (MSSC) consist in partitioning this set into clusters su...

This paper focuses on the use of different memory strategies to improve multistart methods. A network design problem in which the costs are given by discrete...

Minimum sum-of-squares clustering (MSSC) consists in partitioning a given set of <i>n</i> points into <i>k</i> clusters in order to minimize the sum of squar...

Methods, models, heuristic and exact algorithms for clustering are reviewed from a mathematical programming view point.

A recent proof of NP-hardness of Euclidean sum-of-squares clustering, due to Drineas et al., <i>Machine Learning</i> 56, 9--33, 2004, is not valid. An altern...

Minimum sum-of-squares clustering consists in partitioning a given set of <i>n</i> points into <i>c</i> clusters in order to minimize the sum of squared dist...

To the best of our knowledge, the complexity of minimum sum-of-squares clustering is unknown. Yet, it has often been stated that this problem is NP-hard. We...

We address a multi-objective version of the car sequencing problem, which consists in sequencing a given set of cars to be produced in a single day, minimizi...