This specific ISBN edition is currently not available.View all copies of this ISBN edition:
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.
"synopsis" may belong to another edition of this title.
L. R. Ford, Jr., worked as a researcher for both CEIR Inc. and the Rand Corporation before his retirement. D. R. Fulkerson (1924-1976) was a mathematician at the Rand Corporation and, later, Cornell University.
"About this title" may belong to another edition of this title.
Book Description Princeton Univ Pr, 1962. Hardcover. Condition: New. Seller Inventory # DADAX0691079625
Book Description Princeton University Press. Condition: new. Seller Inventory # think0691079625
Book Description Condition: New. New. Seller Inventory # E-0691079625
Book Description Condition: New. New. Seller Inventory # M-0691079625