Home Mathematics Flows in Networks
book: Flows in Networks
Book
Licensed
Unlicensed Requires Authentication

Flows in Networks

  • Lester Randolph Ford and D. R. Fulkerson
  • Preface by: Robert G. Bland and James B. Orlin
Language: English
Published/Copyright: 2011
View more publications by Princeton University Press

About this book

A landmark work that belongs on the bookshelf of every researcher working with networks

In this classic book, first published in 1962, L. R. Ford, Jr., and D. R. Fulkerson set the foundation for the study of network flow problems. The models and algorithms introduced in Flows in Networks are used widely today in the fields of transportation systems, manufacturing, inventory planning, image processing, and Internet traffic. The techniques presented by Ford and Fulkerson spurred the development of powerful computational tools for solving and analyzing network flow models, and also furthered the understanding of linear programming. In addition, the book helped illuminate and unify results in combinatorial mathematics while emphasizing proofs based on computationally efficient construction. With an incisive foreword by Robert Bland and James Orlin, Flows in Networks is rich with insights that remain relevant to current research in engineering, management, and other sciences.

Author / Editor information

L. R. Ford, Jr., (1927–2017) was a researcher at CEIR Inc. and the Rand Corporation. D. R. Fulkerson (1924–1976) was a mathematician at the Rand Corporation.

Reviews

“[Flows in Networks] should . . . be of great value to the expert and a standard reference source for many years to come.”—H. J. Ryser, Management Science

“The book stands as the principal work on network flow theory. Its authors have performed almost as great a service in preparing this volume for publication as they did in originally developing much of its contents.”—Ronald A. Howard, Proceedings of the IEEE

“The book should be of value not only to those interested in linear programming but also those who are concerned with graph theory.”—Arthur Ziffer, Physics Today

“The book is a natural meeting ground for persons interested in communication engineering or combinatorial mathematics.”Journal of Data Management

“The book is a very welcome addition to the literature and should be of extreme value to anyone interested in operations research, communication theory, or combinatorial mathematics.”—A. Newhouse, Computing Review


Publicly Available Download PDF
i

Publicly Available Download PDF
vii

Publicly Available Download PDF
ix

Publicly Available Download PDF
xvii

Publicly Available Download PDF
xix
CHAPTER I STATIC MAXIMAL FLOW

Requires Authentication Unlicensed

Licensed
Download PDF
1

Requires Authentication Unlicensed

Licensed
Download PDF
2

Requires Authentication Unlicensed

Licensed
Download PDF
4

Requires Authentication Unlicensed

Licensed
Download PDF
9

Requires Authentication Unlicensed

Licensed
Download PDF
10

Requires Authentication Unlicensed

Licensed
Download PDF
11

Requires Authentication Unlicensed

Licensed
Download PDF
14

Requires Authentication Unlicensed

Licensed
Download PDF
15

Requires Authentication Unlicensed

Licensed
Download PDF
17

Requires Authentication Unlicensed

Licensed
Download PDF
22

Requires Authentication Unlicensed

Licensed
Download PDF
23

Requires Authentication Unlicensed

Licensed
Download PDF
23

Requires Authentication Unlicensed

Licensed
Download PDF
26

Requires Authentication Unlicensed

Licensed
Download PDF
30

Requires Authentication Unlicensed

Licensed
Download PDF
35
CHAPTER II FEASIBILITY THEOREMS AND COMBINATORIAL APPLICATIONS

Requires Authentication Unlicensed

Licensed
Download PDF
36

Requires Authentication Unlicensed

Licensed
Download PDF
36

Requires Authentication Unlicensed

Licensed
Download PDF
42

Requires Authentication Unlicensed

Licensed
Download PDF
50

Requires Authentication Unlicensed

Licensed
Download PDF
53

Requires Authentication Unlicensed

Licensed
Download PDF
55

Requires Authentication Unlicensed

Licensed
Download PDF
57

Requires Authentication Unlicensed

Licensed
Download PDF
59

Requires Authentication Unlicensed

Licensed
Download PDF
61

Requires Authentication Unlicensed

Licensed
Download PDF
64

Requires Authentication Unlicensed

Licensed
Download PDF
67

Requires Authentication Unlicensed

Licensed
Download PDF
75

Requires Authentication Unlicensed

Licensed
Download PDF
79

Requires Authentication Unlicensed

Licensed
Download PDF
91
CHAPTER III MINIMAL COST FLOW PROBLEMS

Requires Authentication Unlicensed

Licensed
Download PDF
93

Requires Authentication Unlicensed

Licensed
Download PDF
95

Requires Authentication Unlicensed

Licensed
Download PDF
111

Requires Authentication Unlicensed

Licensed
Download PDF
113

Requires Authentication Unlicensed

Licensed
Download PDF
127

Requires Authentication Unlicensed

Licensed
Download PDF
130

Requires Authentication Unlicensed

Licensed
Download PDF
134

Requires Authentication Unlicensed

Licensed
Download PDF
137

Requires Authentication Unlicensed

Licensed
Download PDF
140

Requires Authentication Unlicensed

Licensed
Download PDF
142

Requires Authentication Unlicensed

Licensed
Download PDF
151

Requires Authentication Unlicensed

Licensed
Download PDF
162

Requires Authentication Unlicensed

Licensed
Download PDF
169
CHAPTER IV MULTI-TERMINAL MAXIMAL FLOWS

Requires Authentication Unlicensed

Licensed
Download PDF
173

Requires Authentication Unlicensed

Licensed
Download PDF
173

Requires Authentication Unlicensed

Licensed
Download PDF
176

Requires Authentication Unlicensed

Licensed
Download PDF
177

Requires Authentication Unlicensed

Licensed
Download PDF
187

Requires Authentication Unlicensed

Licensed
Download PDF
191

Requires Authentication Unlicensed

Licensed
Download PDF
193

Publishing information
Pages and Images/Illustrations in book
eBook published on:
December 3, 2024
eBook ISBN:
9780691273457
Pages and Images/Illustrations in book
Main content:
216
Downloaded on 10.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/9780691273457/html
Scroll to top button