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.
Table of Contents:
- 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
Another Princeton book authored or coauthored by D. R. Fulkerson: