A revised and expanded advanced-undergraduate/graduate text (first ed., 1978) about optimization algorithms for problems that can be formulated on graphs and networks. This edition provides many new applications and algorithms while maintaining the classic foundations on which contemporary algorithm
". . .a must for the student with an interest in network optimization and a valuable addition to the library of any researcher in the area. "
"Includes new material based on developments since the First Edition, a new chapter on computer representation of graphs and computational complexity issues, and a software (NETSOLVE) for IBM PCs and compatibles. "
---The American Mathematical Monthly
Introduction to Graphs and Networks Computer Representation and Solution Tree Algorithms Shortest-Path Algorithms Minimum-Cost Flow Algorithms Matching and Assignment Algorithms The Postman and Related Arc Routing Problems The Traveling Salesman and Related Vertex Routing Problems Location Problems Project Networks NETSOLVE User's Manual