1. Network optimization: Algorithms and applications

   • Giorgio Gallo
   • Michael D. Grigoriadis

   Foreword Pages: 105 - 108

2. A polynomial time primal network simplex algorithm for minimum cost flows

   • James B. Orlin

   OriginalPaper Pages: 109 - 129

3. A new strongly polynomial dual network simplex algorithm

   • Ronald D. Armstrong
   • Zhiying Jin

   OriginalPaper Pages: 131 - 148

4. A new pivot selection rule for the network simplex algorithm

   • P. T. Sokkalingam
   • Prabha Sharma
   • Ravindra K. Ahuja

   OriginalPaper Pages: 149 - 158

5. On strongly polynomial dual simplex algorithms for the maximum flow problem

   • Donald Goldfarb
   • Wei Chen

   OriginalPaper Pages: 159 - 168

6. Dynamic trees as search trees via euler tours, applied to the network simplex algorithm

   • Robert E. Tarjan

   OriginalPaper Pages: 169 - 177

7. How to compute least infeasible flows

   • S. Thomas McCormick

   OriginalPaper Pages: 179 - 194

8. Flows on hypergraphs

   • Riccardo Cambini
   • Giorgio Gallo
   • Maria Grazia Scutellà

   OriginalPaper Pages: 195 - 217

9. Multiflows and disjoint paths of minimum total cost

   • Alexander V. Karzanov

   OriginalPaper Pages: 219 - 242

10. A branch-and-cut algorithm for the equicut problem

    • Lorenzo Brunetta
    • Michele Conforti
    • Giovanni Rinaldi

    OriginalPaper Pages: 243 - 263

11. The steiner tree packing problem in VLSI design

    • M. Grötschel
    • A. Martin
    • R. Weismantel

    OriginalPaper Pages: 265 - 281

12. Minimum-perimeter domain assignment

    • Jonathan Yackel
    • Robert R. Meyer
    • Ioannis Christou

    OriginalPaper Pages: 283 - 303