Knapsack Problems

封面
Springer Science & Business Media, 2004年2月20日 - 546 頁
4 書評
評論未經驗證,但 Google 會查證並移除遭檢舉的不實內容
Thirteen years have passed since the seminal book on knapsack problems by Martello and Toth appeared. On this occasion a former colleague exclaimed back in 1990: "How can you write 250 pages on the knapsack problem?" Indeed, the definition of the knapsack problem is easily understood even by a non-expert who will not suspect the presence of challenging research topics in this area at the first glance. However, in the last decade a large number of research publications contributed new results for the knapsack problem in all areas of interest such as exact algorithms, heuristics and approximation schemes. Moreover, the extension of the knapsack problem to higher dimensions both in the number of constraints and in the num ber of knapsacks, as well as the modification of the problem structure concerning the available item set and the objective function, leads to a number of interesting variations of practical relevance which were the subject of intensive research during the last few years. Hence, two years ago the idea arose to produce a new monograph covering not only the most recent developments of the standard knapsack problem, but also giving a comprehensive treatment of the whole knapsack family including the siblings such as the subset sum problem and the bounded and unbounded knapsack problem, and also more distant relatives such as multidimensional, multiple, multiple-choice and quadratic knapsack problems in dedicated chapters.
 

讀者評論 - 撰寫評論

我們找不到任何評論。

內容

IV
1
V
5
VI
9
VIII
11
IX
15
XI
17
XII
20
XIII
27
CXXI
291
CXXII
292
CXXIII
293
CXXIV
294
CXXV
296
CXXVI
298
CXXVII
299
CXXVIII
301

XIV
29
XV
37
XVI
43
XVIII
44
XIX
46
XX
50
XXI
53
XXII
54
XXIII
60
XXIV
62
XXV
65
XXVI
67
XXVII
73
XXVIII
75
XXIX
76
XXX
79
XXXI
80
XXXII
81
XXXIII
82
XXXIV
85
XXXVI
86
XXXVII
87
XXXVIII
88
XXXIX
89
XLI
90
XLIII
93
XLIV
94
XLV
97
XLVI
112
XLVII
117
XLVIII
119
L
124
LI
125
LII
127
LIII
130
LIV
131
LV
136
LVII
138
LVIII
140
LIX
142
LX
144
LXI
147
LXII
150
LXIII
154
LXIV
155
LXV
156
LXVI
161
LXVIII
166
LXIX
169
LXX
171
LXXI
175
LXXII
177
LXXIII
185
LXXV
187
LXXVI
190
LXXVII
191
LXXVIII
194
LXXIX
200
LXXXI
201
LXXXII
202
LXXXIII
204
LXXXIV
205
LXXXV
211
LXXXVII
214
LXXXVIII
215
LXXXIX
216
XC
219
XCI
220
XCII
223
XCIII
227
XCIV
228
XCV
232
XCVI
235
XCVIII
238
XCIX
246
CI
248
CII
252
CIV
254
CV
255
CVI
256
CVII
261
CVIII
264
CIX
266
CX
268
CXI
269
CXII
271
CXIII
272
CXIV
273
CXVI
276
CXVII
280
CXVIII
285
CXX
288
CXXIX
304
CXXXI
311
CXXXII
315
CXXXV
317
CXXXVII
319
CXXXVIII
322
CXXXIX
325
CXL
327
CXLII
328
CXLIII
329
CXLIV
331
CXLV
332
CXLVI
335
CXLVII
338
CXLVIII
339
CXLIX
340
CL
342
CLI
349
CLIII
351
CLIV
352
CLVI
355
CLVII
356
CLVIII
359
CLIX
362
CLX
367
CLXI
373
CLXII
374
CLXIII
375
CLXIV
379
CLXV
380
CLXVI
382
CLXVII
384
CLXVIII
389
CLXXI
391
CLXXII
393
CLXXIII
395
CLXXIV
397
CLXXV
401
CLXXVI
402
CLXXVII
404
CLXXVIII
407
CLXXIX
408
CLXXX
409
CLXXXI
411
CLXXXII
412
CLXXXIII
413
CLXXXIV
414
CLXXXV
415
CLXXXVI
416
CLXXXVII
419
CLXXXVIII
421
CLXXXIX
423
CXC
424
CXCI
425
CXCII
426
CXCIII
427
CXCIV
430
CXCV
431
CXCVI
433
CXCVII
436
CXCVIII
437
CXCIX
440
CC
442
CCI
445
CCII
449
CCIV
450
CCV
452
CCVI
455
CCVII
459
CCVIII
461
CCX
462
CCXI
464
CCXII
465
CCXIII
466
CCXIV
468
CCXV
469
CCXVI
472
CCXVII
473
CCXVIII
475
CCXIX
477
CCXX
478
CCXXI
479
CCXXII
481
CCXXIII
483
CCXXV
487
CCXXVI
488
CCXXVII
490
CCXXVIII
491
CCXXX
495
CCXXXI
527
CCXXXII
535
版權所有

其他版本 - 查看全部

常見字詞

熱門章節

第 499 頁 - An Algorithm for Maximizing Target Achievement in the Stochastic Knapsack Problem with Normal Returns, Naval Research Logistics, 40, 161-173 (1993).

書目資訊