Network Flows: Theory, Algorithms, and ApplicationsPrentice Hall, 1993 - 846 pagine A comprehensive introduction to network flows that brings together the classic and the contemporary aspects of the field, and provides an integrative view of theory, algorithms, and applications.
|
Sommario
INTRODUCTION | 1 |
PATHS TREES AND CYCLES | 23 |
ALGORITHM DESIGN AND ANALYSIS | 53 |
Copyright | |
21 sezioni non visualizzate
Altre edizioni - Visualizza tutto
Network Flows: Pearson New International Edition: Theory, Algorithms, and ... Ravindra K. Ahuja,Thomas L. Magnanti,James B. Orlin Anteprima non disponibile - 2013 |
Parole e frasi comuni
adjacency list Application arc costs arc flows arc lengths augmenting path augmenting path algorithm bipartite capacity scaling algorithm commodity constraints cost flow problem define denote Dijkstra's algorithm directed path discussion distance label Exercise feasible flow feasible solution Fibonacci heap flow algorithms formulation implementation integer iteration Kruskal's algorithm label-correcting algorithm Lagrangian multiplier Lagrangian relaxation Lemma linear programming lower bound matching matrix maximum flow problem minimum cost flow minimum spanning tree multicommodity flow problem N₁ negative cycle network contains network flow problem network G network simplex algorithm node potentials nonnegative NP-complete O(nm objective function value operation optimal solution optimality conditions path from node preflow-push algorithm reduced cost residual network s-t cut satisfies scaling phase Section shortest path distances shortest path problem Show shown in Figure simplex method source node Suppose Theorem undirected units of flow upper bound variables zero