# Claudio Contardo

Back## Publications

### Cahiers du GERAD

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

BibTeX reference

Given a ground-set of elements and a family of subsets, the set covering problem consists in choosing a minimum number of elements such that each subset cont...

BibTeX reference

Given a set `\(\mathcal{N}\)`

of size `\(n\)`

, a non-negative, integer-valued distance matrix `\(D\)`

of dimensions `\(n\times n\)`

, an integer `(p\in\mathb...

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

BibTeX reference

Personnel scheduling consists in determining employee work schedules (sequences of work shifts and days off) to cover the demands of multiple jobs over a pl...

BibTeX reference

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

Column generation (CG) algorithms are well known to suffer from convergence issues due, mainly, to the degenerate structure of their master problem and the ...

BibTeX reference**Claudio Contardo**and Alain Hertz

Given a set `\(\mathcal{R}\)`

of *m* disjoint finite regions in the *2*-dimensional plane, all regions having polygonal boundaries, and given a set `(\mathc...

Column generation algorithms for solving vehicle routing problems often rely on a relaxed pricing subproblem where routes may be non-elementary and which is ...

BibTeX reference**Claudio Contardo**, and Julian Yarkony

We address the problem of accelerating column generation (CG) for set-covering formulations via dual optimal inequalities (DOI). DOI use knowledge of the du...

BibTeX referenceThe conditional \(p\)-dispersion problem

**Claudio Contardo**

We introduce the conditional `\(p\)`

-dispersion problem (c-pDP), an incremental variant of the `\(p\)`

-dispersion problem (pDP). In the c-pDP, one is given a...

**Claudio Contardo**and Jorge A. Sefair

We present a progressive approximation algorithm for the exact solution of several classes of interdiction games in which two non-cooperative players (namely...

BibTeX reference**Claudio Contardo**

Given `\(n\)`

points, a symmetric dissimilarity matrix `\(D\)`

of dimensions `\(n\times n\)`

and an integer `\(p\geq 2\)`

, the `\(p\)`

-dispersion problem (pD...

Vehicle routing problems (VRPs) are among the most studied problems in operations research. Nowadays, the leading exact algorithms for solving many classes o...

BibTeX reference**Claudio Contardo**, Manuel Iori, and Raphael Kramer

The vertex `\(p\)`

-center problem consists in selecting `\(p\)`

centers among a finite set of candidates and assigning a set of clients to them, with the aim...

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

Branch-price-and-cut is a leading methodology for solving various vehicle routing problems (VRPs). For many VRPs, the pricing problem of a branch-price-and-c...

BibTeX reference

The vehicle routing problem with time windows (VRPTW) consists of finding least-cost vehicle routes to satisfy the demands of customers that can be visited...

BibTeX reference**Claudio Contardo**

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**Claudio Contardo**

In this article we introduce the Quadratic Capacitated Vehicle Routing Problem (QCVRP), a combinatorial optimization problem that arises in practical applica...

BibTeX reference

In this paper we present a comparative study of several strategies that can be applied to achieve the so-called elementary lower bound in vehicle routing p...

BibTeX reference### Articles

**Claudio Contardo**, and Matthieu Gruson

**Claudio Contardo**, and Matthieu Gruson

**Claudio Contardo**, Andrea Lodi, and Andrea Tramontani

**Claudio Contardo**and Luciano Costa

**Claudio Contardo**, Guy Desaulniers, and Julian Yarkony

**Claudio Contardo**and Jorge A. Sefair

**Claudio Contardo**

**Claudio Contardo**, and Julian Yarkony

**Claudio Contardo**

**Claudio Contardo**, Guy Desaulniers, and Diego Galindo Pecin

**Claudio Contardo**

**Claudio Contardo**, and Guy Desaulniers

**Claudio Contardo**

**Claudio Contardo**, Manuel Iori, and Raphael Kramer

**Claudio Contardo**

**Claudio Contardo**, and Ivan Contreras

**Claudio Contardo**, Guy Desaulniers, and Eduardo Uchoa

**Claudio Contardo**

**Claudio Contardo**, Guy Desaulniers, and François Lessard

**Claudio Contardo**, Jean-François Cordeau, and Bernard Gendron

**Claudio Contardo**, Jean-François Cordeau, and Bernard Gendron

**Claudio Contardo**, Jean-François Cordeau, and Bernard Gendron

**Claudio Contardo**, Vera C. Hemmelmayr, and Teodor Gabriel Crainic

### Book chapters

**Claudio Contardo**

### Proceedings

**Claudio Contardo**, Guy Desaulniers, Fausto Errico, Alejandro Mac Cawley, and Jorge Vera

**Claudio Contardo**