BODIN, LAWRENCE. Twenty years of routing and scheduling, Operations Research, 38 (1990): 571-579. A survey of real-world situations where routing and scheduling were used, written by a pioneer in this area.

DOLAN, ALAN, and JOAN ALDUS. Networks and Algorithms: An Introductory Approach, Wiley, Chichester, UK, 1993. An excellent introduction to graph theory algorithms.

GUSFIELD, DAN. Algorithms on Strings, Trees, and Sequences, Cambridge University Press, New York, 1997. Details applications of graph theory in pattern recognition and reconstruction problems.

80

JONES, NEIL C., and PAVEL A. PEVZNER. An Introduction to Bioinformatics Algorithms, MIT Press, Cambridge, MA, 2004. This book contains material on how graph theory ideas, particularly those related to Hamiltonian circuits, are being used in molecular genetics and computational biology.

LAWLER, EUGENE, J. LENSTRA, RINNOY KAN, and D. SHMOYS, eds. The Traveling Salesman Problem, Prentice-Hall, Englewood Cliffs, NJ, 1985. Includes survey and technical articles on all aspects of the TSP.

LUCAS, WILLIAM, FRED ROBERTS, and ROBERT THRALL, eds. Discrete and Systems Models, Vol. 3: Modules in Applied Mathematics, Springer-Verlag, New York, 1983. Chapter 6, “A Model for Municipal Street Sweeping Operations,” by A. Tucker and L. Bodin, describes street-sweeping and related models in detail. Other chapters detail many recent applications of mathematics.

ROBERTS, FRED S., and BARRY TESMAN. Applied Combinatorics, 2nd ed., Pearson Prentice Hall, Upper Saddle River, NJ, 2004. The material on network- optimization problems is excellent.

ROBERTS, FRED. Graph Theory and Its Applications to Problems of Society, Society for Industrial and Applied Mathematics, Philadelphia, 1978. A very readable account of how graph theory is finding a wide variety of applications.