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
  • RAIRO. Operations research
  • Volume 35 (2001)
  • no. 1

Volume 35 (2001) no. 1

Table of contents


Bottleneck capacity expansion problems with general budget constraints
Burkard, Rainer E.; Klinz, Bettina; Zhang, Jianzhong
p. 1-20

The Lorenz transform approach to the optimal repair-cost limit replacement policy with imperfect repair
Dohi, T.; Othman, F. S.; Kaio, N.; Osaki, Sunji
p. 21-36

Optimal and near-optimal (s,S) inventory policies for Levy demand processes
Roundy, Robin O.; Samorodnitsky, Gennady  
p. 37-70

Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervals
Gordon, Valery S.; Werner, F.;   Yanushkevich, O. A.
p. 71-83

Multiple routing strategies in a labelled network
Maublanc, J.; Peyrton, D.;   Quilliot, A.  
p. 85-106

On minimizing total tardiness in a serial batching problem
Baptiste, Philippe;   Jouglet, Antoine  
p. 107-115

Complexity of partial inverse assignment problem and partial inverse cut problem
Yang, Xiaoguang
p. 117-126

Solving the simple plant location problem by genetic algorithm
Kratica, Jozef; Tošic, Dušan; Filipović, Vladimir; Ljubić, Ivana  
p. 127-142
  • Accessibility: not compliant
  • About
  • Help
  • Legal notice
  • Contact

Published by

Supported by

 

Partner of