This paper introduces a new integrated model for the combined day-off and shift scheduling problem (the tour scheduling problem). This model generalizes the...

We explore how a simple linear change of variable affects the inclusion functions obtained with Interval Analysis methods. Univariate and multivariate pol...

We describe a tabu search algorithm for the vehicle routing problem with split deliveries. At each iteration, a neighbour solution is obtained by removing a ...

This paper provides a framework for logistics decision-making by classifying logistics decisions and highlighting the relevant linkages among them. We focus ...

Several methods for reducing the variance in the context of Monte Carlo simulation are based on correlation induction. This includes antithetic variates, L...

We study the structure and point out weaknesses of recently-proposed random number generators based on special types of linear recurrences with small coeffic...

We develop stochastic models of time-dependent arrivals, with focus on the application to call centers. Our models reproduce essential features of call cen...

Corrected Miller-Tucker-Zemlin type subtour elimination constraints for the Capacitated Vehicle Routing Problem are presented.

We consider the problem of maximizing the revenue raised from tolls set on the arcs of a transportation network, under the constraint that users are assign...

We present an exact algorithm and three applications of nonconvex quadratically constrained quadratic programming. First, we consider the pooling problem fro...

This paper deals with the design of a new proposed optical core transport network called the YottaWeb, which offers information delivery at rates thousand of...

In this article, we optimally solve an integrated production and material handling scheduling problem. Traditionally, scheduling problems consider machines a...

The aim of this paper is to present efficient algorithms for the detection of multiple targets in noisy images of a torus. The algorithms are based on the ...

Hypermetric inequalities have many applications, most recently in the approximate solution of max-cut problems by linear and semidefinite programming. Howeve...

We develop and analyze parallelization strategies for the Variable Neighborhood Search (VNS) meta-heuristic applied to the <i>p</i>-median problem. The stra...

Dans une rubrique de la Revue Française de Recherche Opérationnelle intitulée <i>Problèmes plaisans et délectables</i> en hommage à l'oeuvre du 17ème siècle ...

Albertson (1997) defines the <i>imbalance</i> of an edge (<i>i,j</i>) in <i>E</i> of a graph <i>G</i> = (<i>V,E</i>) as | <i>d_i - d_j</...

The airline revenue management problem can be decomposed into four distinct but related sub-problems that are usually treated separately: demand forecasting...

The Travelling Salesman Problem (TSP) is a well-researched problem whose interest lies well beyond the Icosian game or the Knight's tour puzzle. In this pap...

This paper describes a real-time fleet-management system for an underground mine. Dispatching, routing, and scheduling are handled simultaneously, taking...