Flows in Networks
Author(s): Lester Randolph Ford Jr.; D. R. Fulkerson
Publisher: Princeton University Press
ISBN: 9780691146676
Edition:
$39,99
Delivery: This can be downloaded Immediately after purchasing.
Version: Only PDF Version.
Compatible Devices: Can be read on any device (Kindle, NOOK, Android/IOS devices, Windows, MAC)
Quality: High Quality. No missing contents. Printable
Recommended Software: Check here
Important: No Access Code
Description
Description
A landmark work that belongs on the bookshelf of every researcher working with networks In this classic book, first published in 1962, L. R. Ford, Jr., and D. R. Fulkerson set the foundation for the study of network flow problems. The models and algorithms introduced in Flows in Networks are used widely today in the fields of transportation systems, manufacturing, inventory planning, image processing, and Internet traffic. The techniques presented by Ford and Fulkerson spurred the development of powerful computational tools for solving and analyzing network flow models, and also furthered the understanding of linear programming. In addition, the book helped illuminate and unify results in combinatorial mathematics while emphasizing proofs based on computationally efficient construction. With an incisive foreword by Robert Bland and James Orlin, Flows in Networks is rich with insights that remain relevant to current research in engineering, management, and other sciences.
