Flows in Networks

Flows in Networks - Princeton Landmarks in Mathematics

Revised

Paperback (12 Nov 2010)

Not available for sale

Includes delivery to the United States

Out of stock

This service is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Publisher's Synopsis

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. Flows in Networks is rich with insights that remain relevant to current research in engineering, management, and other sciences. This landmark work belongs on the bookshelf of every researcher working with networks.

Book information

ISBN: 9780691146676
Publisher: Princeton University Press
Imprint: Princeton University Press
Pub date:
Edition: Revised
DEWEY: 519.72
DEWEY edition: 22
Language: English
Number of pages: 194
Weight: 322g
Height: 235mm
Width: 156mm
Spine width: 14mm