Enjoy 40% off

Everything on De Gruyter Brill *

Chapter

CHAPTER II. FEASIBILITY THEOREMS AND COMBINATORIAL APPLICATIONS

Lester Randolph Ford and D. R. Fulkerson

Published by

View more publications by Princeton University Press

To Publisher Page

Flows in Networks

This chapter is in the book Flows in Networks

© 2016 Princeton University Press, Princeton

You are currently not able to access this content.

You are currently not able to access this content.

Chapters in this book

Frontmatter i
PREFACE vii
ACKNOWLEDGMENTS ix
CONTENTS xi
CHAPTER I. STATIC MAXIMAL FLOW 1
CHAPTER II. FEASIBILITY THEOREMS AND COMBINATORIAL APPLICATIONS 36
CHAPTER III. MINIMAL COST FLOW PROBLEMS 93
CHAPTER IV. MULTI-TERMINAL MAXIMAL FLOWS 173
INDEX 193
Backmatter 195

https://doi.org/10.1515/9781400875184-004

Chapters in this book

Frontmatter i
PREFACE vii
ACKNOWLEDGMENTS ix
CONTENTS xi
CHAPTER I. STATIC MAXIMAL FLOW 1
CHAPTER II. FEASIBILITY THEOREMS AND COMBINATORIAL APPLICATIONS 36
CHAPTER III. MINIMAL COST FLOW PROBLEMS 93
CHAPTER IV. MULTI-TERMINAL MAXIMAL FLOWS 173
INDEX 193
Backmatter 195

Institutional Access

How does access work?

Downloaded on 6.8.2025 from https://www.degruyterbrill.com/document/doi/10.1515/9781400875184-004/html