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):||16 November 2016|
|PDF File Size:||13.42 Mb|
|ePub File Size:||12.94 Mb|
|Price:||Free* [*Free Regsitration Required]|
Maringer Limited preview – On this occasion a former colleague exclaimed back in The purpose of this paper problemw 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.
My library Help Advanced Book Search. Citations Publications citing problemx paper. 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 psiinger 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.
Where are the hard knapsack problems?
David Pisinger’s optimization codes
From This Paper Figures, tables, and topics from this paper. Hence, two years ago the idea knapsak 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.
Thirteen years have passed since the seminal book on knapsack problems by Martello and Toth appeared. Skip to search form Skip to main content.
Knapsack Problems – Hans Kellerer, Ulrich Pferschy, David Pisinger – Google Books
Showing of 16 references. Are Lower Bounds Easier over the Reals? A time-varying transfer function for balancing the exploration and exploitation ability of a binary PSO Md. Algorithm Time complexity Coefficient Experiment.
Knapsack problem Search for additional papers on this topic. This paper has highly influenced 33 other papers. Knapsack problem Dynamic programming Branch and bound Pseudo-polynomial time.
Polynomial Benchmark computing Computation Code. Account Options Sign in. 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.
References Publications referenced by this paper. Topics Discussed in This Paper.
Where are the hard knapsack problems? – Semantic Scholar
User Review – Flag as inappropriate good. Showing of extracted citations. Optimizing VM allocation and data placement for data-intensive applications in cloud using ACO metaheuristic algorithm T.