Network Flows: Theory, Algorithms, and Applications

Ahuja, Ravindra K., Thomas L. Magnanti and James B. Orlin:

ISBN 10: 013617549X / ISBN 13: 9780136175490

Published by Prentice Hall, 1993

About this Item

846 Seiten Das hier angebotene Buch stammt aus einer teilaufgelösten Bibliothek und kann entsprechende Kennzeichnungen aufweisen (Rückenschild, Instituts-Stempel.). Aufgrund des Alters und der häufigen Nutzung können Stabilität, Einband sowie Papierqualität beeinträchtigt sein. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 1405. Seller Inventory # 2236550

Bibliographic Details

Title: Network Flows: Theory, Algorithms, and ...

Publisher: Prentice Hall

Publication Date: 1993

Binding: gebundene Ausgabe

Condition: Gut

About this title

Synopsis:

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.    

From the Back Cover:

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.