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: Samudal Kagakree
Country: Poland
Language: English (Spanish)
Genre: Sex
Published (Last): 4 March 2007
Pages: 144
PDF File Size: 15.74 Mb
ePub File Size: 8.40 Mb
ISBN: 457-3-75214-291-1
Downloads: 62460
Price: Free* [*Free Regsitration Required]
Uploader: Shaktibei

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 poblems variations of practical relevance which were the subject of intensive research during the last few years.

Showing of 16 references. Skip to search form Skip to main content.

Optimizing VM allocation and data placement for data-intensive applications in cloud using ACO metaheuristic algorithm T. Hence, two years ipsinger 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.


David Pisinger’s optimization codes

Knapsack problem Dynamic programming Branch and bound Pseudo-polynomial time. From This Paper Figures, tables, and topics from this paper. References Publications referenced by this paper. 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 prpblems from the literature.

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

Where are the hard knapsack problems?

Where are the hard knapsack problems? My library Help Advanced Book Search.

User Review – Flag as inappropriate good. Showing of extracted citations. A time-varying transfer function for balancing the prooblems and exploitation ability of a binary PSO Md. Polynomial Benchmark computing Computation Code. Algorithm Time complexity Coefficient Experiment. On this occasion a former colleague exclaimed back in Maringer Limited preview – This paper has highly influenced 33 other papers.


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.

Account Options Sign in. Thirteen years have passed since the seminal book on knapsack problems by Martello and Toth appeared.

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

Citations Publications citing this paper. Are Lower Bounds Easier over the Reals? By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy PolicyTerms of Serviceand Dataset License. Knapsack problem Search for additional papers on this topic.