RAIRO - Operations Research - Recherche Opérationnelle, Tome 36 (2002) no. 1

Sommaire

The maximum capacity shortest path problem : generation of efficient solution sets

Boffey, T. Brian ; Williams, R. C. ; Pelegrín, B. ; Fernandez, P.

p. 1-19

On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications

Bampis, Evripidis ; Giroudeau, R. ; König, J.-C.

p. 21-36

Scheduling multiprocessor tasks on two parallel processors

Błażewicz, Jacek ; Dell'Olmo, Paolo ; Drozdowski, Maciej

p. 37-51

Primal-dual approximation algorithms for a packing-covering pair of problems

Kovaleva, Sofia ; Spieksma, Frits C. R.

p. 53-71

Convergence of prox-regularization methods for generalized fractional programming

Roubi, Ahmed

p. 73-94

Generalized characterization of the convex envelope of a function

Kadhi, Fethi

p. 95-100

Agrégation des similarités : une solution oubliée

Petitjean, Michel

p. 101-108