KEY TOPICS: It offers in-depth and self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including a description of new and novel polynomial-time algorithms for these core models. MARKET: For professionals working with network flows, optimization, and network programming.