Network Flows : Theory, Algorithms, and Applications

Ahuja, Ravindra, Orlin, James, Magnanti, Thomas

ISBN 10: 013617549X / ISBN 13: 9780136175490

Editore: Pearson Education, 1993

Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good. Codice articolo GRP17422874

Riassunto:

A comprehensive introduction to network flows that brings together the classic and the contemporary aspects of the field, and provides an integrative view of 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.    

Dati bibliografici

Titolo: Network Flows : Theory, Algorithms, and ...
Casa editrice: Pearson Education
Data di pubblicazione: 1993
Legatura: Rilegato
Condizione: Good