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

In this paper we analyze the problem of finding the trading area for a facility on a linear market. Given the objective of maximizing profit, we first build...

This paper examines a class of asymmetrical multi-depot vehicle routing problems and location-routing problems, under capacity or maximum cost restrictions. ...

In this paper, an extension of the classical scheduling problem is considered. It is assumed that tasks are processed on parallel processors, available at d...

Recently we have witnessed the development of a fast growing body of research focused on vehicle routing and scheduling problem structures with time window c...

Location-routing problems involve simultaneously locating a number of facilities among candidate sites and establishing delivery routes to a set of users in ...

This paper considers a vehicle routing problem with full loads and time limit constraints. This problem can be formulated as an asymmetrical travelling sale...