Enhanced quantum evolutionary algorithms for difficult knapsack problems

Authors:
C. Patvardhan;Apurva Narayan;A. Srivastav
Affiliations:
Faculty of Engineering, Dayalbagh Educational Institute, Agra;Faculty of Engineering, Dayalbagh Educational Institute, Agra;Christian-Albrechts-Universitat Zu Kiel, Kiel, Germany
Venue:
PReMI'07 Proceedings of the 2nd international conference on Pattern recognition and machine intelligence
Year:
2007

Citing 6
Cited 1

A new algorithm for the 0-1 knapsack problem

Management Science
Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
A Polynomial Linear Search Algorithm for the n-Dimensional Knapsack Problem

Journal of the ACM (JACM)
Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem

Management Science
Quantum-inspired evolutionary algorithm for a class of combinatorial optimization

IEEE Transactions on Evolutionary Computation
Quantum-inspired evolutionary algorithms with a new termination criterion, Hε gate, and two-phase scheme

IEEE Transactions on Evolutionary Computation

A novel quantum evolutionary algorithm for quadratic knapsack problem

SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics

Quantified Score

Hi-index	0.00

Visualization

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.