Combinatorial Optimization: Networks and MatroidsHolt, Rinehart and Winston, 1976 - 374 עמודים Perceptively written text examines optimization problems that can be formulated in terms of networks and algebraic structures called matroids. Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. A suitable text or reference for courses in combinatorial computing. |
תוכן
INTRODUCTION | 6 |
Chapter | 6 |
Some Apparently NonpolynomialBounded Problems | 8 |
זכויות יוצרים | |
79 קטעים אחרים שאינם מוצגים
מהדורות אחרות - הצג הכל
Combinatorial Optimization: Networks and Matroids <span dir=ltr>Eugene Lawler</span> תצוגה מקדימה מוגבלת - 2012 |
Combinatorial Optimization: Networks and Matroids <span dir=ltr>Eugene L. Lawler</span> תצוגה מקדימה מוגבלת - 2001 |
מונחים וביטויים נפוצים
a₁ acyclic adjacency matrix alternating trees arc lengths assignment problem augmenting path augmenting sequence b₁ backtracing base node bipartite graph bipartite matching c₁ cardinality matching cocycle column combinatorial computation constraints contains cutset digraph directed cycle directed graph dual solution dual variables duality e₁ Edmonds elements equations example exists finite flow network flow problem follows given go to Step graph G greedy algorithm incidence matrix independent set inequalities integer intersection problem kilter labeling procedure linear programming problem M₁ M₂ max-flow min-cut theorem max-min maximum cardinality maximum number maximum weight minimal negative cycles network flow nonbipartite nonnegative number of arcs O(n² O(n³ objective function obtained optimal solution out-of-kilter pair path computation polynomial polynomial-bounded primal and dual proof pseudonode Return to Step S-label scanned Section shortest path problem shown in Figure solve sp₁ spanning tree subgraph subset Suppose Theorem theory u₁ unlabeled vector zero
הפניות לספר זה
Data Structures and Network Algorithms <span dir=ltr>Robert Endre Tarjan</span> אין תצוגה מקדימה זמינה - 1983 |