1. Preface and acknowledgements

   • Bala Shetty

   EditorialNotes Pages: XI - XII

2. Foreword

   • Richard V. Helgason
   • Jeffery L. Kennington

   EditorialNotes Pages: XIII - XIV

3. A survey of dynamic network flows

   • Jay E. Aronson

   OriginalPaper Pages: 1 - 66

4. The auction algorithm for the transportation problem

   • Dimitri P. Bertsekas
   • David A. Castanon

   OriginalPaper Pages: 67 - 96

5. Almost sure critical paths

   • A. Charnes
   • L. Gong
   • L. Sun

   OriginalPaper Pages: 97 - 110

6. On the use of expert systems in network optimization: With an application to matrix balancing

   • Min K. Chiang
   • Stavros A. Zenios

   OriginalPaper Pages: 111 - 140

7. Controlled rounding for tables with subtotals

   • Lawrence H. Cox
   • John A. George

   OriginalPaper Pages: 141 - 157

8. A modeling/solution approach for optimal deployment of a weapons arsenal

   • Fred Glover
   • Darwin Klingman
   • Nancy V. Phillips

   OriginalPaper Pages: 159 - 177

9. Reconstructing shortest paths

   • Christopher B. Lofgren

   OriginalPaper Pages: 179 - 185

10. Stochastic network optimization models for investment planning

    • John M. Mulvey
    • Hercules Vladimirou

    OriginalPaper Pages: 187 - 217

11. Network reoptimization procedures for multiobjective network probelems

    • David L. Olson
    • Bala Shetty
    • Ishwar Murthy

    OriginalPaper Pages: 219 - 232

12. The basis suppression method

    • Bruce W. Patty
    • Richard V. Helgason

    OriginalPaper Pages: 233 - 248

13. Solvingk-shortest and constrained shortest path problems efficiently

    • Christopher C. Skiscim
    • Bruce L. Golden

    OriginalPaper Pages: 249 - 282

14. A surrogate and Lagrangian approach to constrained network problems

    • M. A. Venkataramanan
    • John J. Dinkel
    • John Mote

    OriginalPaper Pages: 283 - 302