Network Flows Theory, Algorithms, and Applications

Ahuja, Ravindra

ISBN 10: 013617549X / ISBN 13: 9780136175490

Verlag: Pearson Education, 1993

Beschreibung

Ships SAME or NEXT business day. We Ship to APO/FPO addr. Choose EXPEDITED shipping and receive in 2-5 business days within the United States. See our member profile for customer support contact info. We have an easy return policy. Bestandsnummer des Verkäufers 53512476

Bibliografische Details

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

Verlag: Pearson Education

Erscheinungsdatum: 1993

Einband: Hardcover

Zustand: Very Good

Über diesen Titel

Inhaltsangabe:

Book by Ahuja Ravindra K Magnanti Thomas L Orlin James B

Reseña del editor:

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.