
Flows in Networks
Princeton University Press
Published on 8. December 2015
Book
Paperback/Softback
212 pages
978-0-691-62539-3 (ISBN)
Article exhausted; check for reprint
Description
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.
More details
Series
Language
English
Place of publication
New Jersey
United States
Target group
College/higher education
Professional and scholarly
Product notice
Paperback (trade)
Dimensions
Height: 235 mm
Width: 152 mm
Weight
28 gr
ISBN-13
978-0-691-62539-3 (9780691625393)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
New editions

Lester Randolph Ford | D. R. Fulkerson
Flows in Networks
Book
10/2010
Princeton University Press
€39.62
Article exhausted; check different version
Persons
Content
*Frontmatter, pg. i*PREFACE, pg. vii*ACKNOWLEDGMENTS, pg. ix*CONTENTS, pg. xi*CHAPTER I. STATIC MAXIMAL FLOW, pg. 1*CHAPTER II. FEASIBILITY THEOREMS AND COMBINATORIAL APPLICATIONS, pg. 36*CHAPTER III. MINIMAL COST FLOW PROBLEMS, pg. 93*CHAPTER IV. MULTI-TERMINAL MAXIMAL FLOWS, pg. 173*INDEX, pg. 193*Backmatter, pg. 195