Books > Business & Money > Management & Leadership > Decision-Making & Problem Solving

Network Flows: Theory, Algorithms, and Applications

Product ID: 013617549X Condition: New

$ 656

includes Duties & VAT

Delivery: 10-20 working days

Ships from USA warehouse.

Secure Transaction

VISA Mastercard ozow

Product Description

Network Flows: Theory, Algorithms, and Applications

presents in-depth, self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including descriptions of polynomial-time algorithms for these core models.
emphasizes powerful algorithmic strategies and analysis tools such as data scaling, geometric improvement arguments, and potential function arguments.
provides an easy-to-understand descriptions of several important data structures, including d-heaps, Fibonacci heaps, and dynamic trees.
devotes a special chapter to conducting empirical testing of algorithms.
features over 150 applications of network flows to a variety of engineering, management, and scientific domains.
contains extensive reference notes and illustrations.

Bringing together the classic and the contemporary aspects of the field, this comprehensive introduction to network flows provides an integrative view of theory, algorithms, and applications. 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. For professionals working with network flows, optimization, and network programming.