• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Flows in Networks

Flows in Networks

Paperback

Series: Princeton Landmarks in Mathematics and Physics

General MathematicsNetworking

ISBN10: 069127343X
ISBN13: 9780691273433
Publisher: Princeton University Press
Published: Dec 3 2024
Pages: 216
Weight: 0.75
Height: 0.50 Width: 6.14 Depth: 9.21
Language: English

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.

1 different editions

Also available

Also from

Ford, Lester Randolph

Also in

General Mathematics