Two new path problems in graphs are studied: MINRANGE, i.e., find a path from a vertex <i>s</i> to a vertex <i>t</i> with the smallest possible range of a...

The multi-depot vehicle scheduling problem with time windows consists of scheduling a fleet of vehicles to cover a set of tasks at minimum cost. Each task i...

A review is made of models and algorithms for probabilistic satisfiability and its extensions. The basic probabilistic satisfiability problem, in decision f...

In the Generalized Traveling Salesman Problem (GTSP), the aim is to determine a least cost Hamiltonian circuit or cycle through several clusters of vertic...

The problem of assigning locomotives to train-segments is very important for railway companies, in view of the high cost of operating locomotives. The prob...

In the airline industry, crew schedules consist of a number of pairings. These are round trips originating and terminating at the same crew home base compo...

We give lower and upper bounds for the number of reducible ears as well as upper bounds for the number of perfect matchings in an elementary bipartite graph...

A mixed graph <i>G_{<img src="theta.gif">}</i> contains both undirected edges and directed arcs. A <i>k</i>-coloring of <i>G<sub><img src="theta.g...

The majority of vehicle routing and crew scheduling problems studied up to date in the literature can be formulated by means of a unified model introduced b...

In this paper we derive lower bounds on the size of a minimum cover of a graph <i>G</i> by computing packings of edges, odd cycles and cliques of <i>G</i> o...

Multiobjective decision making problems occur in a variety of transportation planning settings. These are often ill-defined and may involve several players...

The <i>p</i>-maxisum dispersion problem consists of locating <i>p</i> facilities at vertices of a network in order to maximize the sum of the distances betw...

Splitting a tree is defined as removing all edges of a chain and disconnecting one from the other edges incident with that chain. Splitting a forest is simu...

Local descent methods typically employ a single neighbourhood structure to conduct the search around a candidate solution. In this paper, we propose a metho...

In 1986, Carter published a survey of papers on practical examination timetabling. In the intervening years, there have been a number of new applications, ...

Nous nous penchons sur la modélisation et le traitement de problèmes d'entreposage du type partagé. Nous supposons que l'entrepôt est à charge unitaire et q...

Cluster Analysis is at the crossroad of many disciplines, and has numerous and diverse methods and applications. Mathematical Programming (together with gra...

Several heuristic methods have been developed to solve the location-allocation problem in continuous space. Typically, these algorithms attempt to move in d...

In this paper we consider the daily aircraft routing and scheduling problem (DARSP). It consists of determining daily schedules which maximize the anticipat...

We present a recent optimization approach that can be applied equally to aircraft routing, crew pairing generation and bidding/rostering problems arising in...