Ships in a BOX from Central Missouri! May not include working access code. Will not include dust jacket. Has used sticker(s) and some writing or highlighting. UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes).

Seller Inventory # 000198207U

Contact seller

Report this item

Bibliographic Details

Title: Network Flows: Theory, Algorithms, and Applications
Publisher: Pearson
Publication Date: 1993
Language: English
ISBN 10: 013617549X
ISBN 13: 9780136175490
Binding: hardcover
Edition: 1st Edition.
Condition: Good

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.

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.

"About this title" may belong to another edition of this title.

Store Description

Textbooks_Source is committed to selling new and used books for less money. We offer fast shipping & handling and dedicated customer service support to ensure that you have a great experience as our customer. Thank you for shopping with us!

Visit Seller's Storefront

Seller's business information

TXTB.com, LLC
2711 W. Ash St., Columbia, MO, 65203, U.S.A.

Sale & Shipping Terms

Terms of Sale

We guarantee the condition of every book as it’s described on the AbeBooks websites. If you are not satisfied with your purchase or if the order has not arrived yet, you are eligible for a refund within 30 days of the estimated delivery date. If you have any questions about an order, please us the “Ask Bookseller a Question” link to contact us and we will respond within 2 business days.