Daniel Aloise

Back

Cahiers du GERAD

28 results — page 1 of 2

, , and

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

BibTeX reference
, , , and

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

BibTeX reference
, , , and

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

BibTeX reference
, , , and

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

BibTeX reference
, , , and

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

BibTeX reference
, , , and

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

BibTeX reference
, , and

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

BibTeX reference
, , , and

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

BibTeX reference
, , and

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

BibTeX reference
, , , and

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

BibTeX reference
, , and

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

BibTeX reference
, , , and

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

BibTeX reference
, , and

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

BibTeX reference
, , and

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

BibTeX reference
and

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

BibTeX reference
, , and

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

BibTeX reference
, , , , , and

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

BibTeX reference
, , , , and

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

BibTeX reference
, , and

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

BibTeX reference
, , , , , and

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

BibTeX reference