| 493 | -- | 504 | Odile Favaron, Mekkia Kouider, Maryvonne Mahéo. Edge-vulnerability and mean distance |
| 505 | -- | 519 | Shlomo Moran. Message complexity versus space complexity in fault tolerant broadcast protocols |
| 521 | -- | 529 | Timothy B. Brecht, Charles J. Colbourn. Multiplicative improvements in network reliability bounds |
| 531 | -- | 548 | Giorgio Carpaneto, Mauro Dell'Amico, Matteo Fischetti, Paolo Toth. A branch and bound algorithm for the multiple depot vehicle scheduling problem |
| 549 | -- | 567 | C. W. Duin, A. Volgenant. Reduction tests for the steiner problem in grapsh |
| 569 | -- | 585 | Stavros A. Zenios, Arne Drud, John M. Mulvey. Balancing large social accounting matrices with nonlinear network programming |
| 587 | -- | 594 | Edgar N. Gilbert. A solvable routing problem |
| 595 | -- | 606 | Pierre Hansen, Martine Labbé. p-median of a network |
| 607 | -- | 614 | John H. Vande Vate. The path set polytope of an acyclic, directed graph with an application to machine sequencing |
| 615 | -- | 616 | R. Johnson, M. G. Pilcher. The traveling salesman problem, edited by E. L. Lawler, J. K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, John Wiley & sons, chichester, 1985, 463 pp |
| 616 | -- | 618 | Jack Yurkiewicz. Operations research: Applications and algorithms, by Wayne L. Winston, duxbury Press, Boston, 1987, 1025 pages |