Home
  • Journals
  • Seminars
  • Conferences
  • Books
  • Lecture notes
  • Theses
  • Authors
  • Journals
  • Seminars
  • Conferences
  • Books
  • Lecture notes
  • Theses
  • Authors
Browse issues
  • All
  • Author
  • Title
  • References
  • Full text
Between and
  • All
  • Author
  • Title
  • Date
  • References
  • Keywords
  • Full text
  • Previous
  • RAIRO - Operations Research - Recherche Opérationnelle
  • Volume 35 (2001)
  • no. 2
  • Next

Volume 35 (2001) no. 2

Table of contents


Multicriteria scheduling problems : a survey
T'kindt, V.;   Billaut, J.-C.  
p. 143-163

Minimizing the earliness and tardiness cost of a sequence of tasks on a single machine
Chrétienne, Philippe
p. 165-187

Resource allocation in a mobile telephone network : a constructive repair algorithm
Boizumault, Patrice;   David, Philippe;   Djellab, Housni
p. 189-209

Semi-definite positive programming relaxations for graph K 𝐧 -coloring in frequency assignment
Meurdesoif, Philippe;   Rottembourg, Benoît
p. 211-228

Fast simulation for road traffic network
Jungblut-Hessel, Roberta; Plateau, Brigitte;   Stewart, William J.;   Ycart, Bernard
p. 229-250

Extension of reverse elimination method through a dynamic management of the tabu list
Hanafi, Saïd;   Fréville, Arnaud  
p. 251-267

Separable convexification and DCA techniques for capacity and flow assignment problems
Mahey, P.;   Phong, Thai Q.; Luna, H. P. L.  
p. 269-281

The triangles method to build X-trees from incomplete distance matrices
Guénoche, Alain;   Leclerc, Bruno
p. 283-300
  • About
  • Help
  • Legal notice
  • Contact

Published by

Supported by

 

Partner of