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

This paper establishes a relationship between the concept of hedging point, first introduced in the realm of FMS flow control models, and the turnpike prop...

We outline a system that is being designed to support the modeling of physical distribution situations and the selection or construction of algorithms for t...

In this paper, we address the problem of routing a fleet of vehicles from a central depot to customers with known demands. We consider the classical vehicle...

Piyavskii's algorithm maximizes a univariate function <i>f</i> satisfying a Lipschitz condition. We compare the numbers of iterations needed to obtain a bou...

The primal projective algorithm for linear programs with unknown optimal objective function value is extended to the case where one uses a weighted Karmarka...

This paper deals with an application of the projective algorithm to the solution of a generic nondifferentiable minimization problem. This problem is closel...

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

A certain sequential separability property is established, using a topological argument, and exploiting a convexity-type assumption about objects with direc...

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

This paper presents a linear programming model of the Quebec and New York State power systems which includes a detailed description of the different types o...

Consider the optimal control problem for the two processor flow-shop when processing times for <i>n</i> tasks are (linear) functions of the state. Since th...

In this paper a study on Second and Third degree Stochastic Dominances for the family of concave and convex utility functions is proposed. This is the LDEU...

La programmation mathématique à plusieurs niveaux permet de modéliser adéquatement certaines structures de décision hiérarchisées. Cette thèse contribue au ...

In this paper, we deal with the problem of scheduling parts and robot moves in a roboic cell where the robot is used to feed machines in the cell. The robo...

Consider <i>N</i> entities to be classified, and a matrix of dissimilarities between pairs of them. The split of a cluster is the smallest dissimilarity be...