The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets p. 1 T. Brian Boffey, R. C. Williams, B. Pelegrín and P. Fernandez Published online: 15 July 2002 DOI: https://doi.org/10.1051/ro:2002002 AbstractPDF (178.9 KB)References
On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications p. 21 Evripidis Bampis, R. Giroudeau and J.-C. König Published online: 15 July 2002 DOI: https://doi.org/10.1051/ro:2002003 AbstractPDF (169.2 KB)References
Scheduling multiprocessor tasks on two parallel processors p. 37 Jacek Błażewicz, Paolo Dell'Olmo and Maciej Drozdowski Published online: 15 July 2002 DOI: https://doi.org/10.1051/ro:2002004 AbstractPDF (215.2 KB)References
Primal-dual approximation algorithms for a packing-covering pair of problems p. 53 Sofia Kovaleva and Frits C.R. Spieksma Published online: 15 July 2002 DOI: https://doi.org/10.1051/ro:2002005 AbstractPDF (192.9 KB)References
Convergence of Prox-Regularization Methods for Generalized Fractional Programming p. 73 Ahmed Roubi Published online: 15 July 2002 DOI: https://doi.org/10.1051/ro:2002006 AbstractPDF (181.9 KB)References
Generalized Characterization of the Convex Envelope of a Function p. 95 Fethi Kadhi Published online: 15 July 2002 DOI: https://doi.org/10.1051/ro:2002007 AbstractPDF (89.93 KB)References
Agrégation des similarités : une solution oubliée p. 101 Michel Petitjean Published online: 15 July 2002 DOI: https://doi.org/10.1051/ro:2002001 AbstractPDF (99.33 KB)References