Flows in Networks (eBook)

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

eBook Download: PDF

2015
212 Seiten
Princeton University Press (Verlag)
978-1-4008-7518-4 (ISBN)

Infos

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.

Produkt-Details

• Erscheint lt. Verlag: 8.12.2015
• Reihe/Serie: Princeton Landmarks in Mathematics and Physics
• Reihe/Serie: Princeton Landmarks in Mathematics and Physics
• Reihe/Serie: Princeton Legacy Library
• Reihe/Serie: Princeton Legacy Library
• Verlagsort: Princeton
• Sprache: englisch
• Themenwelt: Mathematik / Informatik ► Mathematik
• Schlagworte: Addition • algorithm • Arbitrarily large • assignment problem • Backtracking • bijection • bipartite graph • Calculation • coefficient • combinatorial proof • combinatorics • Computation • connectedness • Connectivity (graph theory) • Constructive proof • convex combination • convex set • corollary • Cost curve • Covering set • Diagram (category theory) • Difference quotient • Dilworth's theorem • Direct proof • Disjoint sets • Doubly stochastic matrix • Duality (mathematics) • Duality (optimization) • Economic Efficiency • empty set • Equation • equivalence class • equivalence relation • existential quantification • Extreme point • Flow network • formal proof • Function (mathematics) • Hall's Theorem • Hungarian algorithm • Incidence matrix • Inequality (mathematics) • Integer • Iterative Method • Kruskal's Algorithm • latin square • linear equation • Linear Function • Linear Inequality • Linearity • Linear Programming • Line segment • Mathematical Induction • Mathematical Optimization • Max-flow min-cut theorem • Maxima and minima • maximal independent set • Maximal set • Maximum flow problem • Menger's Theorem • mixed graph • Monotonic Function • Natural number • nonlinear system • Nonnegative Matrix • Notation • Optimality criterion • pairwise • Parity (mathematics) • partial derivative • partially ordered set • Permutation • Permutation Matrix • Piecewise linear • Piecewise linear function • Project network • Pure Mathematics • quadratic function • Quantity • rectangle • Recursive definition • Requirement • Restriction (mathematics) • scientific notation • Sign (mathematics) • Simplex Algorithm • Special case • Subset • Summation • Supply (economics) • symmetric function • Theorem • time complexity • Transitive relation • transpose • Tree (data structure) • Upper and lower bounds • Variable (mathematics) • vertex cover • Without loss of generality
• ISBN-10: 1-4008-7518-8 / 1400875188
• ISBN-13: 978-1-4008-7518-4 / 9781400875184