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: Yozshut Jusar
Country: Pakistan
Language: English (Spanish)
Genre: Politics
Published (Last): 27 August 2018
Pages: 419
PDF File Size: 14.83 Mb
ePub File Size: 5.61 Mb
ISBN: 933-4-51138-167-6
Downloads: 90079
Price: Free* [*Free Regsitration Required]
Uploader: Kazraramar

Citations Publications citing this paper. Knapsack problem Search for additional papers on this topic.

Are Lower Bounds Easier over the Reals? Account Options Sign in.

Where are the hard knapsack problems? Thirteen years have passed since the seminal book on knapsack problems by Martello and Toth appeared.

Where are the hard knapsack problems?

Showing of extracted citations. On this occasion a former colleague exclaimed back in Showing of 16 references.

User Pisinver – Flag as inappropriate good. Knapsack problem Dynamic programming Branch and bound Pseudo-polynomial time. 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.


Where are the hard knapsack problems? – Semantic Scholar

My library Help Advanced Book Search. 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 pisknger 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.

Topics Discussed in This Paper. This paper has highly influenced 33 other papers. 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. Optimizing VM allocation probleems data placement for prpblems applications in cloud using ACO metaheuristic algorithm T.

Algorithm Time complexity Coefficient Experiment. A time-varying transfer function for balancing the exploration and exploitation ability of a binary PSO Md.

There was a problem providing the content you requested

From This Problemz Figures, tables, and topics from this paper. Moreover, the extension of the knapsack problem to higher dimensions both in the number of constraints and pgoblems 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.


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. Maringer Limited preview – Polynomial Benchmark computing Computation Code. By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy PolicyTerms of Serviceand Dataset License.

Skip to search form Skip to main content. References Publications referenced by this paper.