|
|
Авторизация |
|
|
Поиск по указателям |
|
|
|
|
|
|
|
|
|
|
Christofides N. — Graph-Theory: an Algorithmic Approach |
|
|
Предметный указатель |
Set covering problem, (SCP), reduction of 40
Set covering problem, (SCP), tree search algorithm for 42-46
Set partitioning problem (SPP) 39
Set partitioning problem (SPP), tree search algorithm for 40-42
Shortest path 150-188
Shortest paths between all pairs of vertices 163-165
Shortest paths between all pairs of vertices, Floyd's algorithm for 164 165
Shortest Steiner tree 143-145
Steiner point 143 144
Steiner problem 142-145
Steiner problem, Euclidean 143
Steiner problem, in graphs 142 143
Steiner problem, rectilinear 144 145
Strict intersection (SI) 98
Subgraph, definition 7
Subgraph, maximal 12
Subgraph, maximal complete see Clique
Subgraph, partial 8
Timetable scheduling 74
Tournament 9
Transitive closure 21
Transmission 106
Transmission, in 107
Transmission, out 107
Transportation problem 342 380-383
Transportation problem, algorithm for 381
Travelling salesman problem 214-281
Travelling salesman problem, lower bound from assignment problem 236 267-275
Travelling salesman problem, lower bound from shortest spanning tree 237 250
Travelling salesman problem, minimax 215
Travelling salesman problem, minisum 215
Travelling salesman problem, tree search algorithm based on assignment problem for 256-266
Travelling salesman problem, vertex penalty algorithm for 244-256
TREE 122-149
Tree search 390-395
Tree search, bounds in 394
| Tree search, branching functions in 394
Tree search, branching in 390
Tree search, breadth first 393
Tree search, depth first 393
Tree search, partitioning a problem in 390
Tree search, pendant vertex in 391
Tree search, resolution of problem in 390
Tree, alternating 345
Tree, augmenting 346
Tree, blossomed 346
Tree, directed 122-124 211
Tree, division of 130
Tree, elementary transformations of 126
Tree, flow equivalent 301-308
Tree, hungarian 350-352
Tree, longest spanning 139 301
Tree, merging of 130
Tree, shortest spanning 135-137 237-256
Tree, shortest spanning, Kruskaf's algorithm for 137
Tree, shortest spanning, Prim's algorithm for 138 139
Tree, spanning 122 196
Tree, spanning, algorithm to generate all 126-132
Tree, spanning, number of 125 126
Tree-graph 134 135
Triple operation 164 174 175
Vehicle dispatching 48
Vertex, capacity of 297 298
Vertex, definition 1
Vertex, essential 21
Vertex, exposed 342
Vertex, final 1
Vertex, inessential, (redundant) 21
Vertex, initial 1
Vertex, inner 345
Vertex, outer 345
Vertex, pseudo 346
Vertex, terminal 1
|
|
|
Реклама |
|
|
|