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: Daijin Mukree
Country: Guinea
Language: English (Spanish)
Genre: Career
Published (Last): 13 July 2008
Pages: 163
PDF File Size: 15.95 Mb
ePub File Size: 15.83 Mb
ISBN: 826-3-97690-700-5
Downloads: 10742
Price: Free* [*Free Regsitration Required]
Uploader: Mura

Citations Publications citing this paper.

There was a problem providing the content you requested

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 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.

Polynomial Benchmark computing Computation Code. Maringer Limited preview – Skip to search form Skip to main content.


Where are the hard knapsack problems? – Semantic Scholar

Where are the hard knapsack problems? Showing of extracted citations. On this occasion a former colleague exclaimed back in Thirteen knapsackk have passed since the seminal book on knapsack problems by Martello and Toth appeared.

Algorithm Time complexity Coefficient Experiment.

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

Knapsack problem Search for additional papers on this topic. From This Paper Figures, tables, and topics from this paper.

Optimizing VM allocation and data placement for data-intensive applications in cloud using ACO metaheuristic algorithm T. This paper has highly influenced 33 other papers.

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

Showing of 16 references. Hence, two years ago the idea arose to produce a new monograph covering not only the most recent developments of knnapsack standard knapsack problem, but also giving a comprehensive treatment of the whole knapsack family pissinger the siblings such as the subset sum problem and the bounded and unbounded knapsack problem, and also more probles relatives such as multidimensional, multiple, multiple-choice and quadratic knapsack problems in dedicated chapters.


By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy PolicyTerms of Serviceand Dataset License. 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.

User Review – Flag as inappropriate good. Account Options Sign in.

Knapsack problem Dynamic programming Branch and bound Pseudo-polynomial time. References Publications referenced by this paper.

Topics Discussed in This 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.