| 書目名稱 | Knapsack Problems | | 編輯 | Hans Kellerer,Ulrich Pferschy,David Pisinger | | 視頻video | http://file.papertrans.cn/544/543730/543730.mp4 | | 概述 | This is the only book devoted entirely to Knapsack problems, which are most basic combinatorial optimization problems.Includes supplementary material: | | 圖書封面 |  | | 描述 | 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 | | 出版日期 | Book 2004 | | 關(guān)鍵詞 | algorithms; combinatorial optimization; computer; computer science; linear optimization; optimization; pro | | 版次 | 1 | | doi | https://doi.org/10.1007/978-3-540-24777-7 | | isbn_softcover | 978-3-642-07311-3 | | isbn_ebook | 978-3-540-24777-7 | | copyright | Springer-Verlag Berlin Heidelberg 2004 |
The information of publication is updating
|
|
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-5 08:54
發(fā)表于 2025-3-21 16:49:46
