| 489 | -- | 505 | R. Johnson. Network reliability and acyclic orientations |
| 507 | -- | 513 | Andrea S. LaPaugh, Christos H. Papadimitriou. The even-path problem for graphs and digraphs |
| 515 | -- | 530 | Azuma Ohuchi, Ikuo Kaji. Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs |
| 531 | -- | 544 | D. Ronen, Yehoshua Perl. Heuristics for finding a maximum number of disjoint bounded paths |
| 545 | -- | 565 | Jacques Desrosiers, François Soumis, Martin Desrochers. Routing with time windows by column generation |
| 567 | -- | 570 | Jane N. Hagstrom. Note on independence of arcs in antiparallel for network flow problems |
| 571 | -- | 586 | Alberto Marchetti-Spaccamela, A. H. G. Rinnooy Kan, Leen Stougie. Hierarchical vehicle routing problems |
| 587 | -- | 596 | Harilaos N. Psaraftis. On the practical importance of asymptotic optimality in certain heuristic algorithms |
| 597 | -- | 0 | Edward Minieka. Graph theory and applications, by H. Neville V. Temperley, Halsted Press, New York, 1981, 130 pp. Price: $44.95 |
| 597 | -- | 598 | Yoshi Ikura. Network optimization practice: A Computational Guide, by D. K. Smith, John Wiley, New York, 1982, 237 pp. Price: $59.95 |