Network Flows: Theory, Algorithms, and Applications

Condition - Very Good
The item shows wear from consistent use, but it remains in good condition and functions properly. Item may arrive with damaged packaging or be repackaged. It may be marked, have identifying markings on it, or have minor cosmetic damage. It may also be missing some parts/accessories or bundled items.

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.
Country USA
Brand Pearson
Manufacturer Pearson
Binding Hardcover
ItemPartNumber index
UnitCount 1
Format Illustrated
EANs 9780136175490
ReleaseDate 0000-00-00

Country	USA
Brand	Pearson
Manufacturer	Pearson
Binding	Hardcover
ItemPartNumber	index
UnitCount	1
Format	Illustrated
EANs	9780136175490
ReleaseDate	0000-00-00

Network Flows: Theory, Algorithms, and Applications

You might also like...