Survey of Deterministic Networks

The state-of-the-art of deterministic networks is surveyed with a discussion of shortest path, transportation, assignment, transshipment, maximum flow, minimum spanning tree, Chinese postman, Euler path and multicommodity flow models. The computational complexity of network models is discussed. The survey concentrates on models and algorithms that can be used to solve large-scale problems.