Network Flows : Theory, Algorithms, and Applications

Ahuja, Ravindra K.; Magnanti, T. L.; Orlin, James B.

ISBN 10: 013617549X / ISBN 13: 9780136175490

Edité par Pearson, 1993

A propos de cet article

May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers. N° de réf. du vendeur 54088-5

Détails bibliographiques

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

Éditeur : Pearson

Date d'édition : 1993

Reliure : Couverture rigide

Etat : good

A propos de ce titre

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.

Présentation de l'éditeur:

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.