We propose a common solution approach for different crew scheduling problems arising at the planning and operational levels in the airline industry. Specifi...

This paper introduces a strong valid inequality, the 2-path cut, to produce better lower bounds for the Vehicle Routing Problem with Time Windows (VRPTW). ...

This article considers a tool loading problem whose objective is to minimize the number of tool switches over time in order to process several parts on a fl...

The need for an integrating framework for vehicle routing and crew scheduling problems has been apparent for some time. While several attempts have been ma...

Consider a set <i>L</i> of potential locations for <i>p</i> facilities and a set <i>U</i> of locations of given users. The <i>p</i>-median problem is to loc...

<i>Extensive facilities</i> are structures that are too large to be considered as single points. In the first part of this paper we propose integer program...

We study the set of lower bounds which have been proposed for the numbering of a complete graph. We first show that the computation of most of them can be ...

This article describes a lower bounding procedure and heuristics for the <i>Cycle Cover Problem</i> which consists of determining a least cost cover of an u...

Good heuristic solutions for large Multisource Weber problems can be obtained by solving related <i>p</i>-median problems in which potential locations of th...

This paper introduces a new type of constraints, related to schedule synchronization, in the problem formulation of aircraft fleet assignment and routing pr...

This paper contains some 80 annotated references on the vehicle routing problem. The titles are organized as follows: 1) the classical VRP with capacity an...

In recent years, there have been several important algorithmic developments for the traveling salesman problem and the vehicle routing problem. These inclu...

The multisource Weber problem is to locate simultaneously <i>m</i> facilities in the Euclidean plane in order to minimize the total transportation cost for ...

We consider a weekly locomotive scheduling problem encountered at Swedish State Railways. The objective is to find cyclic locomotive schedules, which minim...

A hypergraph <i>H=(X,E)</i> is <i>nested</i> if its edges are pairwise disjoint or included one into the other. The <i>nesticity</i> of <i>H</i> is defined...

The purpose of this paper is to develop optimal tool partitioning policies and strip sequencing strategies for a class of flexible manufacturing problems. ...

Given a set of entities, Cluster Analysis aims at finding subsets, called clusters, which are homogeneous and/or well separated. As many types of clusterin...

La méthode de génération de colonnes est couramment utilisée pour résoudre des problèmes d'optimisation de grande taille. En pratique, on observe fréquemmen...

We study both the continuous and discrete problems of maximizing the product of two linear functions subject to all variables being between 0 and~1. We fir...

Cet article présente une étude comparative des algorithmes de flot maximum pour la résolution du problème de fermeture maximale sur un graphe. Plusieurs ap...