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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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