| 109 | -- | 130 | Oscar Barros, Andres Weintraub. Spatial market equilibrium problems as network models |
| 131 | -- | 156 | Philip C. Jones, Romesh Saigal, Michael H. Schneider. A variable-dimension homotopy on networks for computing linear spatial equilibria |
| 157 | -- | 163 | Frieda Granot, Refael Hassin. Multi-terminal maximum flows in node-capacitated networks |
| 165 | -- | 181 | M. T. Shing, T. C. Hu. A decomposition algorithm for multi-terminal networks flows |
| 183 | -- | 206 | Darwin D. Klingman, Robert F. Schneider. Microcomputer-based algorithms for large scale shortest path problems |
| 207 | -- | 212 | Nancy V. Phillips. A new variant of the partitioning shortest path algorithm |
| 213 | -- | 221 | A. J. Goldman, Prasoon Tiwari. Allowable processing orders in the accelerated cascade algorithm |
| 223 | -- | 237 | Ming S. Hung, Walter O. Rom, Allan D. Waren. Degeneracy in transportation problems |
| 239 | -- | 248 | Yoshiro Ikura, George L. Nemhauser. Computational experience with a polynomial-time dual simplex algorithm for the transportation problem |
| 249 | -- | 257 | John Mote. The family constrained network problem |
| 259 | -- | 276 | Agha Iqbal Ali, Jeff L. Kennington. The asymmetric M-travelling salesmen problem: A duality based branch-and-bound algorithm |
| 277 | -- | 286 | Fred Glover, Beth Novick. The 2-quasi-greedy algorithm for cardinality constrained matroid bases |
| 287 | -- | 292 | Stephen T. Hedetniemi, Renu C. Laskar, John Pfaff. A linear algorithm for finding a minimum dominating set in a cactus |