Network Flows: Theory, Algorithms, and Applications - Hardcover

Ravindra K. Ahuja; Thomas L. Magnanti; James B. Orlin

Hardcover

ISBN 10: 013617549X ISBN 13: 9780136175490

Verlag: Prentice Hall, 1993

Inhaltsangabe

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.    

Details zur Ausgabe

• Verlag: Prentice Hall
• Erscheinungsdatum: 1993
• Sprache: Englisch
• ISBN 10: 013617549X
• ISBN 13: 9780136175490
• Einband: Gebundene Ausgabe
• Anzahl der Seiten: 846
• Kontakt zum Hersteller: Pearson Benelux BV; productsafety@pearson.com; ; Kabelweg 37; Amsterdam; 1014 BA; Niederlande