Abstract
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.
Chapter PDF
References
Martello, S., Toth, P.: A new algorithm for the 0-1 knapsack problem. Management Science 34, 633–644 (1988)
Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. J. Wiley, Chichester (1990)
Martello, S., Toth, P.: Upper bounds and algorithms for hard 0-1 knapsack problems. Operations Research 45, 768–778 (1997)
der Heide, F.M.a.: A polynomial linear search algorithm for the n-dimensional knapsack problem. Journal of the ACM 31, 668–676 (1984)
Pisinger, D.: An expanding-core algorithm for the exact 0-1 knapsack problem. European Journal of Operational Research 87, 175–187 (1995)
Pisinger, D.: Where are the Hard Knapsack Problems, Technical Report, 2003-8, DIKU, University of Copenhagen, Denmark
Martello, S., Pisinger, D., Toth, P.: Dynamic programming and strong bounds for the 0-1 knapsack problem. Management Science 45, 414–424 (1999)
Han, K.H., Kim, J.H.: Quantum-Inspired Evolutionary Algorithm for a Class of Combinatorial Optimization. IEEE Transactions on Evolutionary Computation 6(6), 580–593 (2002)
Han, K.H., Kim, J.H.: Quantum-Inspired Evolutionary Algorithms with a New Termination Criterion, Hε Gate, and Two-Phase Scheme. IEEE Transactions on Evolutionary Computation 8(2), 156–169 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Patvardhan, C., Narayan, A., Srivastav, A. (2007). Enhanced Quantum Evolutionary Algorithms for Difficult Knapsack Problems. In: Ghosh, A., De, R.K., Pal, S.K. (eds) Pattern Recognition and Machine Intelligence. PReMI 2007. Lecture Notes in Computer Science, vol 4815. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77046-6_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-77046-6_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77045-9
Online ISBN: 978-3-540-77046-6
eBook Packages: Computer ScienceComputer Science (R0)