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.
| ISBN: | 9780691273433 |
| Publication date: | 3rd December 2024 |
| Author: | L R Ford, D R Fulkerson |
| Publisher: | Princeton University Press |
| Format: | Paperback |
| Pagination: | 216 pages |
| Series: | Princeton Landmarks in Mathematics and Physics |
| Genres: |
Applied mathematics Combinatorics and graph theory Computer networking and communications |
A landmark work that belongs on the bookshelf of every researcher working with networksIn this classic book, first published in 1962, L. R.
Flows in Networks features in the following genres: Applied mathematics, Combinatorics and graph theory, Computer networking and communications
Paperback. Not Available.
Flows in Networks was written by L R Ford, D R Fulkerson and published by Princeton University Press
Flows in Networks has 216 pages
Yes it is part of Princeton Landmarks in Mathematics and Physics series