Tome 36 (2002) no. 1

Sommaire

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