دانلود کتاب Flows in Networks

فهرست مطالب :

Preface\nAcknowledgements\nCONTENTS\nCHAPTER I. STATIC MAXIMAL PLOW\n Introduction\n 1. Networks\n 2. Flows in networks\n 3. Notation\n 4. Cuts\n 5. Maximal Bow\n 6. Disconnecting sets and cuts\n 7. Multiple sources and sinks\n 8. The labeling method for solving maximal flow problems\n 9. Lower bounds on arc flows\n 10. Flows in undirected and mixed networks\n 11. Node capacities and other extensions\n 12. Linear programming and duality principles\n 13. Maximal flow value as a function of two arc capacities\n References\nCHAPTER II. FEASIBILITY THEOREMS AND COMBINATORIAL APPLICATIONS\n Introduction\n 1. A supply-demand theorem\n 2. A symmetric supply-demand theorem\n 3. Circulation theorem\n 4. The Konig-Egervary and Menger graph theorems\n 5. Construction of a maximal independent set of admissible cells\n 6. A bottleneck assignment problem\n 7. Unicursal graphs\n 8. Dilworth\'s chain decomposition theorem for partially ordered sets\n 9. Minimal number of individuals to meet a fixed schedule of tasks\n 10. Set representatives\n 11. The subgraph problem for directed graphs\n 12. Matrices composed of O\'s and l\'s\n References\nCHAPTER III. MINIMAL COST FLOW PROBLEMS\n Introduction\n 1. The Hitchcock problem\n 2. The optimal assignment problem\n 3. The general minimal cost flow problem\n 4. Equivalence of Hitchcock and minimal cost flow problems\n 5. A shortest chain algorithm\n 6. The minimal cost supply-demand problem: non-negative directed cycle costs\n 7. The warehousing problem\n 8. The caterer problem\n 9. Maximal dynamic flow\n 10. Project cost curves\n 11. Constructing minimal cost circulations\n References\nCHAPTER IV. MULTI-TERMINAL MAXIMAL FLOWS\n Introduction\n 1. Forests, trees, and spanning subtrees\n 2. Realization conditions\n 3. Equivalent networks\n 4. Network synthesis\n References