Sommaire du Fascicule no. 1

The maximum capacity shortest path problem : generation of efficient solution sets
On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications
Scheduling multiprocessor tasks on two parallel processors
Primal-dual approximation algorithms for a packing-covering pair of problems
Convergence of prox-regularization methods for generalized fractional programming
Generalized characterization of the convex envelope of a function
Agrégation des similarités : une solution oubliée

Sommaire du Fascicule no. 2

Minimization of communication expenditure for seasonal products
Refined non-homogeneous markovian models for a single-server type of software system with rejuvenation
Scheduling jobs in open shops with limited machine availability
A theoretical model for testing new product sales velocity at small format retail stores
Technical comment. A problem on Markov chains

Sommaire du Fascicule no. 3

A dimension-reduction algorithm for multi-stage decision problems with returns in a partially ordered set
Optimal QoS control of interacting service stations
A Markov chain model for traffic equilibrium problems
Optimal policies for a database system with two backup schemes
Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation

Sommaire du Fascicule no. 4

Differential approximation of NP-hard problems with equal size feasible solutions
On the M/G/1 retrial queue subjected to breakdowns
Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances
An algorithm for solving multiple objective integer linear programming problem
Un ordonnancement dynamique de tâches stochastiques sur un seul processeur