A01=D. R. Fulkerson
A01=Lester Randolph Ford
Age Group_Uncategorized
Age Group_Uncategorized
Algorithm
Arbitrarily large
Assignment problem
Author_D. R. Fulkerson
Author_Lester Randolph Ford
automatic-update
Bijection
Calculation
Category1=Non-Fiction
Category=PBUH
Category=UTF
Coefficient
Combinatorics
Computation
Connectedness
Connectivity (graph theory)
Convex combination
COP=United States
Corollary
Cost curve
Delivery_Pre-order
Diagram (category theory)
Difference quotient
Dilworth's theorem
Direct proof
Doubly stochastic matrix
Duality (mathematics)
Duality (optimization)
Economic efficiency
Empty set
eq_bestseller
eq_computing
eq_isMigrated=2
eq_nobargain
eq_non-fiction
Equation
Extreme point
Flow network
Formal proof
Function (mathematics)
Incidence matrix
Integer
Iterative method
Kruskal's algorithm
Language_English
Latin square
Linear equation
Linear inequality
Linear programming
Mathematical induction
Mathematical optimization
Max-flow min-cut theorem
Maxima and minima
Maximal independent set
Maximal set
Maximum flow problem
Monotonic function
Natural number
Nonnegative matrix
Optimality criterion
PA=Temporarily unavailable
Pairwise
Partial derivative
Partially ordered set
Permutation
Permutation matrix
Price_€100 and above
PS=Active
Quadratic function
Quantity
Requirement
Restriction (mathematics)
Sign (mathematics)
Simplex algorithm
softlaunch
Special case
Subset
Summation
Supply (economics)
Symmetric function
Theorem
Time complexity
Transitive relation
Tree (data structure)
Upper and lower bounds
Variable (mathematics)
Vertex cover
Without loss of generality
Product details
- ISBN 9780691651842
- Weight: 454g
- Dimensions: 152 x 235mm
- Publication Date: 19 Apr 2016
- Publisher: Princeton University Press
- Publication City/Country: US
- Product Form: Hardback
- Language: English
Secure
checkout
Fast Shipping
Easy returns
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.
