Operations Research

Vol. 35 No. 2 (April-June 2001)

• Multicriteria scheduling problems: a survey     p. 143
  V. T'kindt and J.-C. Billaut
  Abstract | References | PDF file (244 KB)



• Minimizing the Earliness and Tardiness Cost of a Sequence of Tasks on a Single Machine     p. 165
  Philippe Chrétienne
  Abstract | References | PDF file (236 KB)



• Resource allocation in a mobile telephone network: A constructive repair algorithm     p. 189
  Patrice Boizumault, Philippe David and Housni Djellab
  Abstract | References | PDF file (216 KB)



• Semi-Definite positive Programming Relaxations for Graph K-Coloring in Frequency Assignment     p. 211
  Philippe Meurdesoif and Benoît Rottembourg
  Abstract | References | PDF file (200 KB)



• Fast simulation for Road Traffic Network     p. 229
  Roberta Jungblut-Hessel, Brigitte Plateau, William J. Stewart and Bernard Ycart
  Abstract | References | PDF file (272 KB)



• Extension of Reverse Elimination Method Through a Dynamic Management of the Tabu List     p. 251
  Saïd Hanafi and Arnaud Fréville
  Abstract | References | PDF file (215 KB)



• Separable convexification and DCA techniques for capacity and flow assignment problems     p. 269
  P. Mahey, Thai Q. Phong and H.P.L. Luna
  Abstract | References | PDF file (171 KB)



• The triangles method to build X-trees from incomplete distance matrices     p. 283
  Alain Guénoche and Bruno Leclerc
  Abstract | References | PDF file (204 KB)

© EDP Sciences 2001