Schedule compression is a major concern in project management. We propose an extension of the classical crashing model to include the managerial practice of...

This paper shows how the subtour elimination constraints developed by Miller, Tucker and Zemlin for the traveling salesman problem can be improved and exten...

We consider projects represented by a PERT network, with convex cost-of-time functions on individual activities, and we show the existence of an efficient m...

The multiple vehicle many-to-many routing problem is presented in the context of a dial-a-ride system. It is solved by mini-clustering first and optimal ro...

We present an algorithm that solves the problem of finding the vehicle schedule which minimizes total inconveniences for travel along a fixed path, where se...

Le problème classique d'optimisation de la capacité des réseaux de télécommunications s'énonce comme suit: pour un réseau dont la structure, la demande et l...

Several single-commodity, two-commodity and multi-commodity flow formulations have recently been introduced for the travelling salesman problem. The purpose...

In this paper, we present general formulations for the stochastic vehicle routing problem with capacity restrictions in which the <i>m</i> vehicle tours hav...

Given a weighted graph with profits associated with the vertices, the selective travelling salesman problem (or orienteering problem) consists of selecting ...

We present a dual algorithm to minimize a separable convex function under ratio constraints between variables. This minimization problem occurs when the dep...

The problem is to elaborate a minimum cost transportation plan by simultaneously solving the following two sub-problems: the assignment of available units at...

This paper deals with efficient computation of a certain type of Nash-Cournot equilibria in multi-stage oligopolies. The generic structure analyzed herein r...

We consider an oligopolistic industry extracting a non-renewable resource sold in a competitive market. We show, first, that if all players, but one, have i...

We present an algorithm that solve the problem of finding the best vehicle time schedule (minimizing total inconveniences) for a fixed path, knowing that vis...

This paper describes a family of stochastic location-routing problems which consist of simultaneously locating a depot among a set of potential sites, of det...

Nous analysons dans cette thèse le marché européen du gaz naturel et les échanges d'électricité entre réseaux interconnectés dans le cadre de la théorie des ...

This note deals with the concept of stochastic equilibrium-programming <i>SEP</i> which has recently been proposed for the modeling of imperfect competition ...

The urban transit crew scheduling problem arises in mass transit corporations who have to create minimal cost bus driver schedule respecting both the collect...

A model is presented for looking at the main characteristics of long term gas contracts. The problem is formulated as a dynamic stochastic multimarket model...

This paper presents mathematical formulations for some vehicle routing and scheduling problems with time window constraints and the optimal solution approach...