Geodesic

Sommaire du Fascicule no. 1

The maximum capacity shortest path problem : generation of efficient solution sets
p. 1-19
On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications
p. 21-36
Scheduling multiprocessor tasks on two parallel processors
p. 37-51
Primal-dual approximation algorithms for a packing-covering pair of problems
p. 53-71
Convergence of prox-regularization methods for generalized fractional programming
p. 73-94
Generalized characterization of the convex envelope of a function
p. 95-100
Agrégation des similarités : une solution oubliée
p. 101-108

Sommaire du Fascicule no. 2

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

Sommaire du Fascicule no. 3

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

Sommaire du Fascicule no. 4

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