1. A transportation problem with a permuted demand vector

   • Steffen G. Meusel
   • Rainer E. Burkard

   Pages: 1 - 7

2. A note on the complexity of the transportation problem with a permutable demand vector

   • Mihály Hujter
   • Bettina Klinz
   • Gerhard J. Woeginger

   Pages: 9 - 16

3. An extension of the entropic perturbation method of linear programming

   • D. G. Tian
   • Q. Fei

   Pages: 17 - 25

4. On polynomial solvability of two multiprocessor scheduling problems

   • Eberhard Girlich
   • Alexander G. Tarnowski

   Pages: 27 - 51

5. Weighted values for non-atomic games: an axiomatic approach

   • J. C. Santos
   • J. M. Zarzuelo

   Pages: 53 - 63

6. Sensitive equilibria for ergodic stochastic games with countable state spaces

   • Andrzej S. Nowak

   Pages: 65 - 76

7. Perishable inventory systems with impatient demands

   • David Perry
   • Wolfgang Stadje

   Pages: 77 - 90

8. Optimal admission control for M/D/1/K queueing systems

   • Hans Daduna
   • Pavel S. Knopov

   Pages: 91 - 100

9. A class of extremum problems related to agency models with imperfect monitoring

   • Jörg Budde
   • Norbert Gaffke

   Pages: 101 - 120

10. Risk measurement with maximum loss

    • Gerold Studer

    Pages: 121 - 134

11. Optimal stopping in Hilbert spaces and pricing of American options

    • Dariusz Gatarek
    • Andrzej ŚwiechRID="*"ID="*"  Andrzej Świ&ecedil;ch was partially supported by NSF grant DMS-9706760

    Pages: 135 - 147

12. Short rate analysis and marked point processes

    • Robert J. Elliott
    • Allanus H. Tsoi
    • Shiu Hong Lui

    Pages: 149 - 160