Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
Авторизация

       
blank
Поиск по указателям

blank
blank
blank
Красота
blank
Cook W.J., Cunningham W.H., Pulleyblank W.R. — Combinatorial optimization
Cook W.J., Cunningham W.H., Pulleyblank W.R. — Combinatorial optimization



Обсудите книгу на научном форуме



Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter


Название: Combinatorial optimization

Авторы: Cook W.J., Cunningham W.H., Pulleyblank W.R.

Аннотация:

A complete, highly accessible introduction to one of today's most exciting areas of applied mathematics. One of the youngest, most vital areas of applied mathematics, combinatorial optimization integrates techniques from combinatorics, linear programming, and the theory of algorithms. Because of its success in solving difficult problems in areas from telecommunications to VLSI, from product distribution to airline crew scheduling, the field has seen a ground swell of activity over the past decade.


Язык: en

Рубрика: Математика/

Серия: Сделано в холле

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Издание: 1 edition

Год издания: 1997

Количество страниц: 368

Добавлена в каталог: 23.05.2011

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
Kruskal's algorithm      11—13 15 17—19 141 245 273
Kruskal's Algorithm, blocks      15
Leaf      194
Legal ordering      74 84
Lexicographic rule      89
Lin — Kernighan heuristic      248 251
Linear programming      15 57 144 325
Linear-programming duality      26 57 225 263 279 298
Linear-programming problem      15—18 27 57 87 91 99 101 145 148 155 162 178 180 183 193 203 205 219 238 260—264 267 279 298 328
Linear-programming relaxation      257 263 269 270
Local improvement      242
LOG      7
Loop      9
LP problem      328
M-alternating      128
M-alternating tree      135—139 152 153
M-augmenting path      128 129 134 135 143
M-covered      127
M-exposed      127
Marriage problem      47
Matchable set      210
Matching      47 127
Matching polyhedra      201 208 214 239
Matching polytope      214
Matching Polytope Theorem      148 214
Matching problem      4
Matroid      274
Matroid Intersection Algorithm      291
Matroid partition theorem      295
Matroid partitioning problem      295
Matroid, basis      275
Matroid, contraction      285 286
Matroid, disjoint union      284
Matroid, duality      286
Matroid, forest      275 277 280—282 284—288 290 294
Matroid, linear      275 281 284 287 292
Matroid, matching      281 284
Matroid, oracle      277 283 284 286 293
Matroid, partition      285 287 288
Matroid, rank      275
Matroid, span      292
Matroid, transversal      284 286 294
Matroid, truncation      284
Matroid, uniform      275 281 285 287
Max-flow min-cut theorem      41 48 52—54 57 58 224
Maximum cut problem      174
Maximum flow algorithm      121
Maximum flow problem      39 91—93 95 100 102 113 118 119 121 125 128 129 143
Maximum integral flow      42
Maximum integral flow problem      39
Maximum matching      127 134
Maximum matching problem      134 140
Maximum-weight b-matching problem      186 191
Maximum-weight matching      161
Maximum-weight matching problem      161
Mean cost of a circuit      103
Menger's Theorem      62
Minimal cut      84
Minimal defining system      212 213 218
Minimum cover      59
Minimum cut      41 45 72
Minimum cut problem      72
Minimum spanning tree      9—19 141 147
Minimum spanning tree problem      11
Minimum-cardinality cover      49
Minimum-cost circulation      100 102
Minimum-cost flow algorithm      186
Minimum-cost flow algorithm, dual      112
Minimum-cost flow algorithm, primal      101
Minimum-cost flow problem      91 128 145 163 182 186 188 189 267
Minimum-cost integral flow      91
Minimum-mean-cost circuit      103
Minimum-weight perfect matching      144—161 245 263
Minmax path problem      36
Minmax spanning tree      19
Moat      192 197
Moat, width      192
Motzkin's theorem      334
MST      11
Multicommodity flow problem      86 263
Multicommodity flow problem, integer      86
Multiterminal cut problem      78
Nagamochi — Ibaraki algorithm      74
Nearest Insertion      244
Nearest Neighbor algorithm      2 7 8 242 243 251 252
Negative-cost circuit      105
Negative-cost dicircuit      93 94 102 120
Neighborset      54
Nested sets      155
Network matrix      223 224
Network simplex method      103—112
Node identification      73 79 131
Node identification algorithm      84
nodes      9
Noncrossing tour      252
Nondeterministic polynomial time      309
NP      309 314
NP-complete      310 316—318
NP-hard      241
Odd components      130 133
Odd cut      147
Odd edge      194
Odd node      135
Odd set      177
one-pass algorithm      31
One-tape Turing machine      321
Open-pit mine      49
Optimal tour      1
Optimal tree solution      125
Optimum solution      328
Original nodes      137
Outdegree      99
Padberg and Rao's algorithm      239
Palindrome      313
Partionable set      295
Path      10
Path cover      61
Path flow      40
Path packing      39
Path, closed      10
Path, edge-simple      10
Path, length of      10
Path, simple      10
Perfect b-matching      182
Perfect matching      127 312 314 315
Perfect Matching Polytope Theorem      201 208 209
Perfect matching problem      315
Petersen's theorem      134
Pivot rule      89 333
Planar dual      174 287
Planar graph      95
Plane embedding      95
PM(G)      208
Pointed polyhedron      205 206 210 219
Polyhedral combinatorics      207 208 212 222 225 237
Polyhedron      203—205 208 210 212—216 218—221 225 230 231 233 234 238 267
Polynomial time      309 313 314 322
Polynomial-time algorithm      8 313 314 318 325
Polynomial-time reduction      315 318
Polytope      204 206
Postman problem      166 167
Postman set      167 168
Postman tour      166
Preflow      62
Pricing      160
Prim's algorithm      12—14 17 18 74 84 147
Primal-dual algorithm      113—119 121 122 124 126 145 186 190
Primality testing      315
Process a node      65
Proper class of polyhedra      238
Proper face      204 212 214 216 232
Pseudonodes      138
push      63 65
Push, nonsaturating      67
Push, saturating      67
push-relabel algorithm      63 66
Push-relabel algorithm, maximum distance      66 67
QUEUE      30
R      16
RAM      323
Random access machine      323
Random contraction algorithm      76 84
Ratio Test      332
Rational polyhedra      218
Rectilinear embedding      96
Rectilinear layout      96
Reduced cost      92 149 150 160 195
Relabel operation      65
Repair      160
Representatives      82
Residual capacity      62
Rooted spanning tree      21
rv-switch      248
S(n,m) (shortest path complexity)      32
SAT      316—318
Satisfiability problem      316
Satisfiable      316 319
Saturated cut      64
Scale-and-Shrink Algorithm      121—126 186
Scaling      35 119 120 123 125
Scanning a node      29
SDR      60
Separation      62 72
Separation problem      237
Shortest augmenting path      44 143 144
Shortest path      19—36 93 94 115 116 119 125
Shortest path problem      20 91 92 94 106 113 116 121 125 168
Shrinking      131
Simple graph      9
Simplex algorithm      262 264 331 333—335
Simplex algorithm, cycle      333
Simplex method      27 29 35 89 103 109 325
Sink      38 113
Size of a word      311
Slither      144
Source      38 113
Spanning directed tree      34
Spanning subgraph      10 11 59 60
Spanning tree      21 27 103 245 246 253—255 260 261 273
Stable set      236
Stable set polytope      236
Step size      255
Stiemke's theorem      334
Strongly feasible tree      108 109 112
Strongly feasible triple      111 112
Strongly polynomial algorithm      122 186
Strongly polynomial time      185 186 188 189 191
Subdigraph      19
Subdigraph from deletion      19
Subgradient optimization      258
Subgraph      10
Subgraph from deletion      10
Submodular      286
Subpaths      21
Subtour bound      259 260
Subtour constraints      259 261—264
Subtours      259
Successive scaling      186
Successive-Scaling Algorithm      121 122 125 126
Supporting hyperplane      204
Symmetric difference      129
System of distinct representatives      60
T-cut      177 239
T-cut problem      239
T-join      167 202
T-join algorithm      172
T-join problem      168
Teeth      264
Tight arc      122—125
Tight circuit      132
Topological sort      30 36
Total dual integrality      225 226 299
Totally dual integral      225—227 236
Totally unimodular      221-224
Tour      1 241 312
Tour construction heuristics      242 243
Tournament      61
Transportation problem      37 92 183
Transshipment problem      92 98 99 101 103 109 111 112 118 119 121 122 124—126
Traveling salesman problem      1 2 4 7 15 25 35 72 111 182 241—271 310 314 321
TREE      11
Tree solution      103—106 109 110 112 124 125
Tree solution, feasible      104 105 110 111 124 125
Tree solution, optimal      104 110 119
Triangle inequality      4 157 181 193 243—246 252 260
TSP      241 321
TSPLIB      2 242—244 246 247 251 271
Turing machine      312 321 322
Tutte — Berge formula      131 132 134 141 143
Tutte's Matching Theorem      131 134 315
Two-connected      217
u-capacitated b-matching      191
Unbounded linear-programming problem      332
Unimodular      220
Universal Turing machine      323
V(G) (node set)      9
Valid inequality      204
Valid labelling      63
Vertex      205
VLSI      86
Weak duality theorem      328 330
Weight-splitting      299
Weighted bipartite matching algorithm      147
Weighted blossom algorithm      154
Weighted Matroid Intersection Algorithm      301 304
Word      311
x-augmenting path      113 128 134
x-incrementing circuit      93 94 101
x-incrementing path      93 113 114 116 117 134
x-width      42
Z      16
[a', a'']-matching      191
1 2
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2024
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте