This paper reviews the literature on vehicle routing problems and location-routing problems with intermediate stops. Besides providing concise paper excerpts...

The purpose of this paper is to develop a fast heuristic called FastCARP for the solution of very large-scale capacitated arc routing problems, with or witho...

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

Personnel scheduling consists of determining least-cost employee work schedules to cover the demand of one or several jobs in each period of a time horizon. ...

In this article, we discuss an alternative method for deriving conservative approximation models for two-stage robust optimization problems. The method main...

Location-routing problems (LRPs) with intra-route facilities have recently gained the attention of researchers and practitioners. Intra-route facilities are ...

The aim of this paper is to computationally compare several algorithms for the Minimum Cost Perfect Matching Problem on an undirected graph. Our work is moti...

Nous donnons des conditions nécessaires et suffisante pour l'existence d'un graphe simple, ou d'un graphe connexe simple, ayant des nombres donnés `(m_{ij}...

This paper addresses the solution of the capacitated minimum cost flow problem on a network containing \(n\) nodes and \(m\) arcs. Satisfying necessary ...

While the joint optimization of production and outbound distribution decisions in a manufacturing context has been intensively studied in the past decade, th...

The distance, distance Laplacian and distance signless Laplacian spectra of a connected graph \(G\) are the spectra of the distance, distance Laplacian and...

The paper discusses bounds on the nullity number of graphs. It is proved in [B. Cheng and B. Liu, On the nullity of graphs. Electron. J. Linear Algebra 16 ...

La méthode de branch-cut-and-price est la plus performante pour une grande panoplie de problèmes de tournées de véhicules (PTV). Pour plusieurs d'entre eux...

Dans cet article, nous nous intéressons à létude des valeurs propres du laplacien des distances d'un graphe connexe d'ordre \(n\) et de nombre chromatique ...

Two-level orthogonal designs play an important role in industrial screening experiments, in which the primary goal is to identify the treatment factors with ...

In this paper, we propose an integer programming model for obtaining lower bounds for the curriculum-based course timetabling problem, in which weekly assign...

This paper describes a vector space decomposition algorithmic framework for linear programming guided by dual feasibility considerations. The resolution pro...

Synchronization of workers and vehicles plays a major role in many industries such as logistics, healthcare or airport ground handling. In this paper, we fo...

Nous étudions ici l'impact des contraintes de niveaux de service dans le contexte des problèmes de planification de production avec ou sans contrainte de cap...