Network Flows: Theory, Algorithms, and Applications

Ahuja, Ravindra; Magnanti, Thomas; Orlin, James

ISBN 10: 013617549X / ISBN 13: 9780136175490

Editore: Pearson, 1993

Riguardo questo articolo

The book is in good condition with all pages and cover intact, including the dust jacket if originally issued. The spine may show light wear. Pages may contain some notes or highlighting, and there might be a "From the library of" label. Boxed set packaging, shrink wrap, or included media like CDs may be missing.

Codice articolo BSM.QVLI

Dati bibliografici

• Titolo: Network Flows: Theory, Algorithms, and Applications
• Editore: Pearson
• Data di pubblicazione: 1993
• Lingua: Inglese
• ISBN 10: 013617549X
• ISBN 13: 9780136175490
• Rilegatura: Rilegato
• Condizione: good

Descrizione articolo

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.