The classical knapsack problem is defined as follows: We are given a set of n items, . Using this concept, Pisinger  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 () –
|Published (Last):||12 July 2006|
|PDF File Size:||12.48 Mb|
|ePub File Size:||13.64 Mb|
|Price:||Free* [*Free Regsitration Required]|
Account Options Sign in. Showing of 16 references. References Publications referenced by this paper. Citations Publications citing this paper.
Where are the hard knapsack problems? – Semantic Scholar
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. Knapsack problem Search for additional papers on this topic. User Review – Flag as inappropriate good.
A time-varying transfer function for balancing the exploration and exploitation ability of a binary PSO Md. Thirteen years have passed since the pisingre book on knapsack knapsacj by Martello and Toth appeared. 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.
Are Lower Bounds Easier over the Reals?
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 problemms 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. On this occasion pgoblems former colleague exclaimed back in Where are the hard knapsack problems?
Skip to search form Skip to main content.
Where are the hard knapsack problems?
Algorithm Time complexity Coefficient Experiment. Maringer Limited preview – Knapsack problem Dynamic programming Branch and bound Knapwack time. From This Paper Figures, tables, and topics from this paper.
Topics Discussed in This Paper.
There was a problem providing the content you requested
Optimizing VM allocation and data placement for data-intensive applications in cloud using ACO metaheuristic algorithm T. 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.
This paper has highly influenced 33 other papers. My library Help Advanced Book Search. 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.
Polynomial Benchmark computing Computation Code.