1. A solvability theorem and minimax fractional programming

   • J. Gwinner
   • V. Jeyakumar

   OriginalPaper Pages: 1 - 12

2. Computing steady-state queueing-time distributions of single-server queues:GI ^X /M/1

   • M. L. Chaudhry
   • M. Agarwal
   • J. G. C. Templeton

   OriginalPaper Pages: 13 - 29

3. Book review

   • H. Ripphausen-Lipa

   BookReview Pages: 30 - 30

4. The quickest flow problem

   • Rainer E. Burkard
   • Karin Dlaska
   • Bettina Klinz

   OriginalPaper Pages: 31 - 58

5. Open shop problems with unit time operations

   • Peter Brucker
   • Bernd Jurisch
   • Marion Jurisch

   OriginalPaper Pages: 59 - 73

6. Book review

   • R. Pincus

   BookReview Pages: 74 - 74

7. Optimal compactification of a floorplan and its relation to other optimization problems-a dynamic programming approach

   • Michael Kolonko

   OriginalPaper Pages: 75 - 95

8. Book review

   • J. Cigler

   BookReview Pages: 96 - 96

9. The best choice problem with an unknown number of objects

   • Aarni Lehtinen

   OriginalPaper Pages: 97 - 106

10. An integer programming formulation of the Steiner problem in graphs

    • Mamadi Diané
    • Ján Plesník

    Short Note Pages: 107 - 111

11. Book reviews

    • M. Schäffter
    • K. Weihe
    • Salah E. Elmaghraby

    BookReview Pages: 112 - 117