Operations Research

Vol. 36 No. 1 (January-March 2002)

• 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
  Abstract | References | PDF file (184 KB)



• On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications     p. 21
  Evripidis Bampis, R. Giroudeau and J.-C. König
  Abstract | References | PDF file (174 KB)



• Scheduling multiprocessor tasks on two parallel processors     p. 37
  Jacek Blazewicz, Paolo Dell'Olmo and Maciej Drozdowski
  Abstract | References | PDF file (221 KB)



• Primal-dual approximation algorithms for a packing-covering pair of problems     p. 53
  Sofia Kovaleva and Frits C.R. Spieksma
  Abstract | References | PDF file (198 KB)



• Convergence of Prox-Regularization Methods for Generalized Fractional Programming     p. 73
  Ahmed Roubi
  Abstract | References | PDF file (187 KB)



• Generalized Characterization of the Convex Envelope of a Function     p. 95
  Fethi Kadhi
  Abstract | References | PDF file (92.9 KB)



• Agrégation des similarités : une solution oubliée     p. 101
  Michel Petitjean
  Abstract | References | PDF file (102 KB)

© EDP Sciences 2002