Enhanced Quantum Evolutionary Algorithms for Difficult Knapsack Problems

Download PDF
Open Webpage

C. Patvardhan, Apurva Narayan, Anand Srivastav

Published: 2007, Last Modified: 13 Oct 2024PReMI 2007EveryoneRevisionsBibTeXCC BY-SA 4.0
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.