√лавна€    Ex Libris     ниги    ∆урналы    —татьи    —ерии     аталог    Wanted    «агрузка    ’удЋит    —правка    ѕоиск по индексам    ѕоиск    ‘орум   
blank
јвторизаци€

       
blank
ѕоиск по указател€м

blank
blank
blank
 расота
blank
Christofides N. Ч Combinatorial Optimization
Christofides N. Ч Combinatorial Optimization



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



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


Ќазвание: Combinatorial Optimization

јвтор: Christofides N.

язык: en

–убрика: ћатематика/јлгебра/ омбинаторика/

—татус предметного указател€: √отов указатель с номерами страниц

ed2k: ed2k stats

√од издани€: 2000

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

ƒобавлена в каталог: 01.12.2004

ќперации: ѕоложить на полку | —копировать ссылку дл€ форума | —копировать ID
blank
ѕредметный указатель
$\varepsilon$-Optimality      16
Abelian semi-group      40
Accuracy      9
Additive semi-group      25
Algorithm, efficient      108Ч111
Algorithm, greedy      109
Alternating subgraph      182
Arbitrage      409Ч419
Arbitrage on straight rates      410
Arbitrage on swop rates      411
Arbitrage, interest      411
Arbitrage, shortest path models for      417
Arborescence      see УDirected spanning treeФ
Assignment problem      136Ч140
Augmenting sequence      110
Augmenting subgraph      182
Baker and Su algorithm for scheduling      374Ч375
Balanced matrix      159
BendersТ partitioning method      21
Benichou partitioning strategy      9
Bin packing      119
Binary encoding      116
Bitroid      110
Bivalent programs      93Ч106
Bivalent programs, solving of      101Ч104
Bottleneck machine      372
Bounded knapsack problem      275Ч276
Bounding function      74Ч78
Branch and bound      1Ч20 28 53 133 243Ч277
Branching      13Ч14
Breadth-first branch and bound      243
Canonical form      178
Capital budgeting      239
Cargo-loading problem      239
Change-making problem      277
Chord      162
Chordless cycle      158
ChristofidesТ heuristic      145Ч146
Chromatic number      113Ч116 213
ChvatalТs operation      33
CLIQUE      157 159Ч162 165 170 177 201 213
Clique, covering problem      151 157
Clique, number      213
Clique, problem      112Ч116
Codes for mixed integer programming      17
Colouring function      213
Column generation      90 152
Comb inequalities      143
Complementarity theory      21
Complementarity theory, conditions      48
complexity      107Ч129 285
Complexity, norm      108
Composite inequalities      178
Computational geometry      111
Concave function      73
Constraints, contradictory      8
Constraints, facial      58 59 63
Constraints, tightening      63
Convex function      73
Convex span      59Ч61
Core knapsack problem      267Ч270
Crew scheduling      153 389Ч408
Critical cutset      161Ч163
Critical edge      161 169
Critical machine      386
Cuts      58
Cutset      161
Cutset, arc      132
Cutting planes      21Ч72 152 171Ч174 178Ч179
Cutting planes, methods for travelling salesman      142Ч143
Cutting planes, strengthening of      26
Cutting planes, weakening of      26 39 48 50 55 58
Cutting stock problem      239
Dantzig upper bound      239Ч240
Decomposable set      181
Degeneracy      7
Degree of infeasibility      11
Depth-first branch and bound      243
Directed spanning tree      134Ч136
Disjunctive arcs      381
Disjunctive graph      381
Disjunctive methods      47Ч71
Disjunctive normal form      171
Disjunctive programming      171
Disjunctive rule theorem      60
Dominance criteria      261
Dynamic programming      238Ч239 274Ч277
Edge covering problem      151 155
Edge matching problem      151 155 156
Efficiency of an algorithm      285
Elementary inequalities      178
Enumeration tree      3Ч5 10Ч12
Eulerian subgraph      120
Expected case norm      108
Face      59
Facets      58 167 172Ч174
Facets of the set packing polytope      158Ч170
Facets, producing graph      164Ч168 177
Fathoming      3Ч5 15Ч16
Fathoming, premature      16
Finiteness      9
Flows in graphs with gains      41
Foreign exchange      409
Game, two-person      61Ч62
Generalized lagrangian method      238
GomoryТs fractional row cut      32
Gradient      73
Graph colouring      122 211Ч235
Graph colouring as a set covering problem      214
Graph colouring, algorithms, colour sequential methods      223Ч224
Graph colouring, algorithms, dichotomous search methods      221Ч223
Graph colouring, algorithms, multiple method      228Ч233
Graph colouring, algorithms, vertex sequential methods      217Ч221
Graph colouring, formulations      214Ч216
Graph colouring, problems; size reduction      216Ч217
Greedy solution of the knapsack problem      260 262 269
Group knapsack problem      6
Group problem      25 30Ч31 39 65
Hamiltonian circuit      131 113Ч116 131Ч149 397
Heuristics      107Ч129
Heuristics for travelling salesman      143Ч146
Heuristics, approximation methods      118
Heuristics, constructive methods      118
Heuristics, decomposition methods      118
Heuristics, deterministic evaluation of      118Ч122
Heuristics, direct search      15
Heuristics, inductive methods      118
Heuristics, probabilistic evaluation of      122Ч126
Homomorphisms      40
Hypergraph      158
Implicit enumeration      3 152 238 274Ч277
Improper face      176
Independence number      160 213
Independent set      213
Integer form      7
Intersection theorem (for binary integer programs)      59
Intersection theorem (for graph colouring)      228Ч229
JacksonТs rule for scheduling      372
Job-shop scheduling problem (general)      380Ч383
Knapsack problem      113Ч116 186 237Ч279 340
Knapsack problem, algorithms for, (dynamic programming)      250Ч257
Knapsack problem, algorithms for, (implicit enumeration)      243Ч250
Knapsack problem, dominance criteria for      261
Knapsack problem, large size      266Ч274
Knapsack problem, reduction procedure for      257Ч260
Knapsack problem, unbounded      274Ч275
Knapsack problem, upper bound for      239Ч243
Knapsack problem, value independent      276
Knapsack problem, zero-one      238Ч276
Lagrangean multipliers      131Ч149
Lateness of jobs on one machine      371Ч388
LIFO strategy      14
Linear combination of constraints      22Ч23 35
Linear inequalities systems      74
Linear programming polytope      181Ч182
LinТs r-optimal heuristic      145
Loading problem      339Ч369
Loading problem, computational results for      349 367
Loading problem, dominance for      344 366
Loading problem, dynamic      354Ч369
Loading problem, feasibility test for      360Ч363
Loading problem, formulation of dynamic      357Ч358
Loading problem, formulation of static      344Ч345
Loading problem, lower bounds for      346 363Ч366
Loading problem, minimal sets for      344
Loading problem, sensitivity for      350Ч353
Loading problem, static      343Ч354
Loading problem, weak maximal sets for      356
Loading problem, weak minimal sets for      356
Location theory      281Ч314
m-Centre problem      281Ч314
m-Centre problem on tree networks      283
m-Centre problem, absolute      281
m-Centre problem, classification scheme for      283
m-Centre problem, complexity of      285Ч287
m-Centre problem, computational results for      304Ч307
m-Centre problem, extensions of      307Ч313
m-Centre problem, inverse      283
m-Centre problem, relaxation algorithm for      287Ч307
Machine scheduling      371Ч388
Matching problem      110 113Ч116 140
Matroid      109Ч110
Maximal r-colourable subset      224
McMahon and Florian algorithm for scheduling      375Ч378
Median      282
Mid-point property      287
Minimal inequalities      39
Minimax criterion      282
Minisum criterion      282
Mixed integer linear program      1 29
Modular arithmitic      22Ч25 33 35
Monoid      25
Monoid, finite      31
Monoid, infinite      31
Monoid, mapping of      40
Monoidal cut strengthening      51Ч52
Multipliers      48 50 66
n-Paths      140Ч142
Nearest insertion rule for travelling salesman      144
Nearest neighbour rule for travelling salesman      144
Network flow problem      110
Node covering problem      151 155
Node packing problem      151 155 157
Node packing problem, polytope      160
Nonsingular submatrix      159
Normal hypergraph      159
NP-complete problem      112Ч116 286 374
NP-complete problem, strong      116
NP-hard problem      112Ч116
Odd anti-hole      160 161 165
Odd hole      160 161 165
Order relations      93Ч105
Partitioning      8 9
Partitioning problem      113Ч116
Path-tree      113Ч116
Penality      6
Penality, down      7
Penality, up      7
Perfect graph      158 159 160
Perfect matching      155
Perfect matrix      159 160
Polynomial bounded algorithm      108
Precedence constraints      371
Priorities      9
Projection method      14
Pseudo costs      9 12Ч13
Pseudo-polynomial algorithms      116
r-Colourable      213
blank
–еклама
blank
blank
HR
@Mail.ru
       © Ёлектронна€ библиотека попечительского совета мехмата ћ√”, 2004-2020
Ёлектронна€ библиотека мехмата ћ√” | Valid HTML 4.01! | Valid CSS! ќ проекте