Flows in Networks

by Lester Randolph Ford Jr., D. R. Fulkerson, Robert G. Bland (Foreword by), James B. Orlin (Foreword by)

Overview

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.

Product Details

ISBN-13:	9780691273433
Publisher:	Princeton University Press
Publication date:	12/03/2024
Series:	Princeton Landmarks in Mathematics and Physics
Pages:	216
Product dimensions:	6.12(w) x 9.25(h) x (d)

About the Author

L. R. Ford, Jr., (1927–2017) was a researcher at CEIR Inc. and the Rand Corporation. D. R. Fulkerson (1924–1976) was a mathematician at the Rand Corporation.

What People are Saying About This

From the Publisher

“[Flows in Networks] should . . . be of great value to the expert and a standard reference source for many years to come.”—H. J. Ryser, Management Science

“The book stands as the principal work on network flow theory. Its authors have performed almost as great a service in preparing this volume for publication as they did in originally developing much of its contents.”—Ronald A. Howard, Proceedings of the IEEE

“The book should be of value not only to those interested in linear programming but also those who are concerned with graph theory.”—Arthur Ziffer, Physics Today

“The book is a natural meeting ground for persons interested in communication engineering or combinatorial mathematics.”—Journal of Data Management

“The book is a very welcome addition to the literature and should be of extreme value to anyone interested in operations research, communication theory, or combinatorial mathematics.”—A. Newhouse, Computing Review

Editorial Reviews

"[Flows in Networks] should . . . be of great value to the expert and a standard reference source for many years to come."—-H. J. Ryser, Management Science

"The book stands as the principal work on network flow theory. Its authors have performed almost as great a service in preparing this volume for publication as they did in originally developing much of its contents."—-Ronald A. Howard, Proceedings of the IEEE

"The book should be of value not only to those interested in linear programming but also those who are concerned with graph theory."—-Arthur Ziffer, Physics Today

From the Publisher

"The book is a natural meeting ground for persons interested in communication engineering or combinatorial mathematics."

Journal of Data Management