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

This report proposes some approximate analytical models allowing the evaluation of the average service time for a user of a door-to-door transportation syst...

This research review presents very recent results in the theory of deterministic scheduling in production systems. The deterministic models dealt with inclu...

The object of this study is to solve a resource sharing problem. One considers a surgery ward with a fixed number of beds. A team of surgeons is sharing th...

We study the design problem of part-orienting systems which are often employed in many manufacturing environments to orient parts of assembly or to perform o...

We study here the classification problem for a particular class of moduloïds over a dioïd, called simple pseudomodules. After introducing the concept of can...

We study the performance of scheduling algorithms for a manufacturing system, called the "No-wait Flowshop", which consists of a certain number of machine ce...

The Basic Algorithm of pseudo-Boolean programming due to Hammer and Rudeanu allows to minimize nonlinear 0-1 functions by recursively eliminating one variabl...

We propose a classification scheme for a class of models that arise in the area of vehicle routing and scheduling and illustrate it on a number of problems t...

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