The classical knapsack problem is defined as follows: We are given a set of n items, . Using this concept, Pisinger [11] introduced a dynamic programming. Thirteen years have passed since the seminal book on knapsack problems by Martello and Toth appeared. On this occasion a former colleague exclaimed back . The knapsack problem is believed to be one of the “easier” NP-hard D. Pisinger/Computers & Operations Research 32 () –

Author: Tekazahn Gakinos
Country: Oman
Language: English (Spanish)
Genre: Environment
Published (Last): 25 September 2014
Pages: 34
PDF File Size: 11.49 Mb
ePub File Size: 17.20 Mb
ISBN: 510-2-77019-704-2
Downloads: 96579
Price: Free* [*Free Regsitration Required]
Uploader: Mokora

Citations Publications citing this paper. 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 problens including the siblings such pisinget 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.

Where are the hard knapsack problems?

Knapsack Problems – Hans Kellerer, Ulrich Pferschy, David Pisinger – Google Books

Optimizing VM allocation and data knapwack for data-intensive applications in cloud using ACO metaheuristic algorithm T. Skip to search form Skip to main content.


References Publications referenced by this paper. On this occasion a former colleague exclaimed back in Showing of 16 references. From This Paper Figures, tables, and topics from this paper. The purpose of this paper is to give an overview of all recent exact solution approaches, and to show that the knapsack problem still is hard to solve for these algorithms for a variety of new test problems.

A time-varying transfer function for balancing the exploration and exploitation ability of a binary PSO Md. My library Help Advanced Book Search.

Polynomial Benchmark computing Computation Code. Maringer Limited preview – By clicking accept or continuing to use the site, you agree psiinger the terms outlined in our Privacy PolicyTerms of Serviceand Dataset License.

Algorithm Time complexity Coefficient Experiment. 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.

David Pisinger’s optimization codes

Not only can it be solved in pseudo-polynomial time, but also decades of algorithmic improvements have made it possible to solve nearly all standard instances from the literature.


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.

Knapsack problem Search for additional papers on this topic. Topics Discussed in This Paper. Knapsack problem Dynamic programming Branch and bound Pseudo-polynomial time.

User Review – Flag as inappropriate good. This paper has highly influenced 33 other papers.

Where are the hard knapsack problems?

Showing of extracted citations. Account Options Sign in.

Are Lower Bounds Easier over the Reals? Thirteen years have passed since the seminal book on knapsack problems by Martello and Toth appeared.