| 249 | -- | 269 | J. Pinto Paixão, I. M. Branco. A quasi-assignment algorithm for bus scheduling |
| 271 | -- | 281 | Alan A. Bertossi, Paolo Carraresi, Giorgio Gallo. On some matching problems arising in vehicle scheduling models |
| 283 | -- | 294 | Moshe Dror, Helman Stern, Pierre Trudeau. Postman tour on a graph with precedence relation on arcs |
| 295 | -- | 305 | Yehoshua Perl. Digraphs with maximum number of paths and cycles |
| 307 | -- | 317 | Jayaram Bhasker, Sartaj Sahni. A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph |
| 319 | -- | 339 | Michael Florian, Jacques Guálat, Heinz Spiess. An efficient implementation of the "partan" variant of the linear approximation method for the network equilibrium problem |
| 341 | -- | 352 | Christopher C. Skiscim, Bruce L. Golden. k-shortest path lengths in euclidean networks |
| 353 | -- | 364 | C. W. Duin, A. Volgenant. Some generalizations of the steiner problem in graphs |