Flows in Networks

Lester Randolph Ford, D. R. Fulkerson (Autoren)

Buch | Hardcover

212 Seiten

2016
Princeton University Press (Verlag)
978-0-691-65184-2 (ISBN)

Lieferbar (Termin unbekannt)
Versandkostenfrei
Auch auf Rechnung

Artikel merken

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.

*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

Erscheinungsdatum	27.05.2016
Reihe/Serie	Princeton Landmarks in Mathematics and Physics
Verlagsort	New Jersey
Sprache	englisch
Maße	152 x 235 mm
Gewicht	454 g
Themenwelt	Mathematik / Informatik ► Informatik ► Netzwerke
	Mathematik / Informatik ► Mathematik ► Angewandte Mathematik
	Mathematik / Informatik ► Mathematik ► Finanz- / Wirtschaftsmathematik
ISBN-10	0-691-65184-1 / 0691651841
ISBN-13	978-0-691-65184-2 / 9780691651842
Zustand	Neuware