|
![]() |
|||
|
||||
OverviewThis 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. Full Product DetailsAuthor: Lester Randolph Ford , D. R. FulkersonPublisher: Princeton University Press Imprint: Princeton University Press Volume: 1903 Dimensions: Width: 15.20cm , Height: 1.10cm , Length: 23.50cm Weight: 0.028kg ISBN: 9780691625393ISBN 10: 0691625395 Pages: 212 Publication Date: 08 December 2015 Audience: College/higher education , Professional and scholarly , Tertiary & Higher Education , Professional & Vocational Replaced By: 9780691146676 Format: Paperback Publisher's Status: Active Availability: Manufactured on demand ![]() We will order this item for you from a manufactured on demand supplier. Language: English Table of ContentsReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |