Knapsack Problems

Knapsack Problems

AngličtinaMěkká vazbaTisk na objednávku
Kellerer Hans
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
EAN: 9783642073113
Tisk na objednávku
Předpokládané dodání v pondělí, 24. června 2024
6 512 Kč
Běžná cena: 7 235 Kč
Sleva 10 %
ks
Chcete tento titul ještě dnes?
knihkupectví Megabooks Praha Korunní
není dostupné
Librairie Francophone Praha Štěpánská
není dostupné
knihkupectví Megabooks Ostrava
není dostupné
knihkupectví Megabooks Olomouc
není dostupné
knihkupectví Megabooks Plzeň
není dostupné
knihkupectví Megabooks Brno
není dostupné
knihkupectví Megabooks Hradec Králové
není dostupné
knihkupectví Megabooks České Budějovice
není dostupné

Podrobné informace

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.
EAN 9783642073113
ISBN 3642073115
Typ produktu Měkká vazba
Vydavatel Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Datum vydání 7. prosince 2010
Stránky 548
Jazyk English
Rozměry 235 x 155
Země Germany
Sekce Professional & Scholarly
Autoři Kellerer Hans; Pferschy Ulrich; Pisinger David
Ilustrace XX, 548 p.
Edice Softcover reprint of hardcover 1st ed. 2004