Flows in Networks
This book presents simple, elegant methods for dealing, both in theory and in application, with a variety of problems that have formulations in terms of flows in capacity-constrained networks. Since the theoretical considerations lead in all cases to computationally efficient solution procedures, the hook provides a common meeting ground for persons interested in operations research, industrial and communications engineering, or combinatorial mathematics.

Originally published in 1962.

The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905.

1120011681
Flows in Networks
This book presents simple, elegant methods for dealing, both in theory and in application, with a variety of problems that have formulations in terms of flows in capacity-constrained networks. Since the theoretical considerations lead in all cases to computationally efficient solution procedures, the hook provides a common meeting ground for persons interested in operations research, industrial and communications engineering, or combinatorial mathematics.

Originally published in 1962.

The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905.

42.0 In Stock

eBook

$42.00 

Available on Compatible NOOK devices, the free NOOK App and in My Digital Library.
WANT A NOOK?  Explore Now

Related collections and offers


Overview

This book presents simple, elegant methods for dealing, both in theory and in application, with a variety of problems that have formulations in terms of flows in capacity-constrained networks. Since the theoretical considerations lead in all cases to computationally efficient solution procedures, the hook provides a common meeting ground for persons interested in operations research, industrial and communications engineering, or combinatorial mathematics.

Originally published in 1962.

The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905.


Product Details

ISBN-13: 9780691273457
Publisher: Princeton University Press
Publication date: 12/03/2024
Series: Princeton Landmarks in Mathematics and Physics
Sold by: Barnes & Noble
Format: eBook
Pages: 216
File size: 185 MB
Note: This product may take a few minutes to download.

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

From the B&N Reads Blog

Customer Reviews