Classical and quantum-inspired electromagnetism-like mechanism for solving 0/1 knapsack problems.
Yao-Hsin ChouChih-Cheng ChangChia-Hui ChiuFang-Jhu LinYi-Jyuan YangZan-Ya PengPublished in: SMC (2010)
Keyphrases
- knapsack problem
- quantum inspired
- implicit enumeration
- binary gravitational search algorithm
- optimal solution
- optimization problems
- quantum computing
- test problems
- immune clonal
- dynamic programming
- exact algorithms
- linear programming relaxation
- np hard
- greedy algorithm
- cutting plane
- binary particle swarm optimization
- cost function