Enhanced Quantum Evolutionary Algorithms for Difficult Knapsack Problems
Difficult knapsack problems are problems that are expressly designed to be difficult. In this paper, enhanced Quantum Evolutionary Algorithms are designed and their application is presented for the solution of the DKPs. The algorithms are general enough and can be used with advantage in other subset selection problems.
KeywordsEvolutionary Algorithms Quantum knapsack
- 6.Pisinger, D.: Where are the Hard Knapsack Problems, Technical Report, 2003-8, DIKU, University of Copenhagen, DenmarkGoogle Scholar
- 7.Martello, S., Pisinger, D., Toth, P.: Dynamic programming and strong bounds for the 0-1 knapsack problem. Management Science 45, 414–424 (1999)Google Scholar