Flows in Networks / / D. R. Fulkerson, Lester Randolph Ford.
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, th...
Saved in:
Superior document: | Title is part of eBook package: De Gruyter Princeton Legacy Lib. eBook Package 1931-1979 |
---|---|
VerfasserIn: | |
Place / Publishing House: | Princeton, NJ : : Princeton University Press, , [2015] ©1962 |
Year of Publication: | 2015 |
Language: | English |
Series: | Princeton Legacy Library ;
54 |
Online Access: | |
Physical Description: | 1 online resource (212 p.) |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- Frontmatter
- PREFACE
- ACKNOWLEDGMENTS
- CONTENTS
- CHAPTER I. STATIC MAXIMAL FLOW
- CHAPTER II. FEASIBILITY THEOREMS AND COMBINATORIAL APPLICATIONS
- CHAPTER III. MINIMAL COST FLOW PROBLEMS
- CHAPTER IV. MULTI-TERMINAL MAXIMAL FLOWS
- INDEX
- Backmatter