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: Vudogore Kagagrel
Country: France
Language: English (Spanish)
Genre: Education
Published (Last): 10 September 2011
Pages: 390
PDF File Size: 17.66 Mb
ePub File Size: 3.5 Mb
ISBN: 596-7-12942-144-4
Downloads: 18288
Price: Free* [*Free Regsitration Required]
Uploader: Dilmaran

Knapsack problem Search for additional papers on this topic. My library Help Advanced Book Search.

Thirteen years have passed since the seminal book on knapsack problems by Martello and Toth appeared. Knapsack problem Dynamic programming Branch and bound Pseudo-polynomial time. 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.


Citations Publications citing this paper.

Are Lower Bounds Easier over the Reals? Skip to search form Skip to main content. Showing of 16 references.

Where are the hard knapsack problems? 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 ipsinger were the subject of intensive research during the last few years.

Polynomial Benchmark computing Computation Code. Algorithm Time complexity Coefficient Experiment. On this occasion a former colleague exclaimed back in Showing of extracted citations. By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy PolicyTerms of Serviceand Dataset License. User Review – Flag as inappropriate good.

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

A time-varying transfer function for balancing the exploration and exploitation ability of a binary PSO Md. 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. However, in the last decade a large number of research publications contributed new results for the knapsack problem in all areas of pksinger such as exact algorithms, heuristics and approximation schemes.


Account Options Sign in.

Maringer Limited preview – 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. References Publications referenced by 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. Topics Discussed in This Paper. From This Paper Figures, tables, and topics from this paper.