Flows in Networks
D. R. Fulkerson, Lester Randolph Ford
Naturwissenschaften, Medizin, Informatik, Technik / Mathematik
Beschreibung
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.
Kundenbewertungen
Combinatorics, Formal proof, Natural number, Special case, Difference quotient, Transitive relation, Simplex algorithm, Vertex cover, Max-flow min-cut theorem, Summation, Equation, Subset, Variable (mathematics), Permutation, Upper and lower bounds, Computation, Connectedness, Function (mathematics), Linear programming, Nonnegative matrix, Economic efficiency, Doubly stochastic matrix, Coefficient, Quadratic function, Theorem, Maxima and minima, Cost curve, Linear inequality, Duality (optimization), Symmetric function, Arbitrarily large, Diagram (category theory), Quantity, Requirement, Optimality criterion, Iterative method, Sign (mathematics), Connectivity (graph theory), Maximum flow problem, Supply (economics), Assignment problem, Bijection, Partially ordered set, Time complexity, Incidence matrix, Linear equation, Monotonic function, Direct proof, Dilworth's theorem, Mathematical induction, Pairwise, Duality (mathematics), Extreme point, Kruskal's algorithm, Without loss of generality, Restriction (mathematics), Tree (data structure), Mathematical optimization, Partial derivative, Corollary, Calculation, Maximal set, Integer, Convex combination, Flow network, Latin square, Permutation matrix, Algorithm, Empty set, Maximal independent set