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.

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.

��ber diesen Titel� kann sich auf eine andere Ausgabe dieses Titels beziehen.

Anbieterinformationen

Zur Homepage des Verk�ufers

Unternehmensdaten des Verk�ufers

SGS Trading Inc
399 Scholar Ct, Franklin Lks, NJ, 07417, U.S.A.

Gesch�ftsbedingungen:

We guarantee the condition of every book as it's described on the Abebooks web sites. If you're dissatisfied with your purchase (Incorrect Book/Not as Described/Damaged) or if the order hasn't arrived, you're eligible for a refund within 30 days of the estimated delivery date. If you've changed your mind about a book that you've ordered, please use the Ask bookseller a question link to contact us and we'll respond within 2 business days.

Versandinformationen:

Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.

Zahlungsarten
akzeptiert von diesem Verk�ufer

Zu Kaufgesuchen hinzuf�gen

Verwandte Artikel zu Network Flows: Theory, Algorithms, and Applications

Network Flows: Theory, Algorithms, and Applications

Ahuja, Ravindra; Magnanti, Thomas; Orlin, James

Neu - Hardcover

Unternehmensdaten des Verk�ufers