Local search methods start from a feasible solution and improve it by successive minor modifications until a solution that cannot be further improved is enco...

This study addresses large-scale personnel scheduling problems in the service industry by combining mathematical programming with data mining techniques to...

The emerging demand for electric bicycles in recent years has prompted several bike-sharing systems (BSS) around the world to adapt their service to a new wa...

The popularity of bike-sharing systems has constantly increased throughout the last years. Most of such success can be attributed to their multiple benefits,...

Providing the right data to a machine learning model is an important step to insure the performance of the model. Non-compliant training data instances may l...

Crew pairing problems (CPP) are regularly solved by airlines to produce crew schedules. The goal of CPPs is to find a set of pairings (sequence of flights a...

In the Weighted Fair Sequences Problem (WFSP), one aims to schedule a set of tasks or activities so that the maximum product between the largest temporal dis...

Distance metric learning algorithms aim to appropriately measure similarities and distances between data points. In the context of clustering, metric learnin...

Drones have been getting more and more popular in many economy sectors. Both scientific and industrial communities aim at making the impact of drones even mo...

We consider the problem of designing vehicle routes in a distribution system that are at the same time cost-effective and visually attractive. In this pape...

The popularity of drones is rapidly increasing across the different sectors of the economy. Aerial capabilities and relatively low costs make drones the perf...

Clustering algorithms help identify homogeneous subgroups from data. In some cases, additional information about the relationship among some subsets of the d...

This paper studies the Dynamic Facility Location Problem with Modular Capacities (DFLPM). We propose a linear relaxation based heuristic (LRH) and an evoluti...

\(K\)-medoids clustering is among the most popular methods for cluster analysis, but it carries several assumptions about the nature of the latent clusters...

Clustering is an automated and powerful technique for data analysis. It aims to divide a given set of data points into clusters which are homogeneous and/o...

Scheduling problems on which constraints are imposed with regard to the temporal distances between successive executions of the same task have numerous appli...

In this article we consider a bi-objective vehicle routing problem in which, in addition to the classical minimization of the total routing cost, the operato...

Clustering addresses the problem of finding homogeneous and well-separated subsets, called clusters, from a set of given data points. In addition to the poi...

The \(k\)-means is a benchmark algorithm used in cluster analysis. It belongs to the large category of heuristics based on location-allocation steps that ...

The balanced clustering problem consists of partitioning a set of \(n\) objects into \(K\) equal-sized clusters as long as \(n\) is a multiple of `(K...

In this paper we propose a new variant of the Variable Neighborhood Decomposition Search (VNDS) heuristic for solving global optimization problems and apply ...

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...