An improved binary quantum-behaved particle swarm optimization algorithm for knapsack problems.
Xiaotong LiWei FangShuwei ZhuPublished in: Inf. Sci. (2023)
Keyphrases
- knapsack problem
- binary variables
- combinatorial optimization problems
- optimal solution
- optimization problems
- test problems
- dynamic programming
- production planning
- np hard
- greedy algorithm
- exact algorithms
- linear programming relaxation
- quantum behaved particle swarm optimization
- non binary
- bicriteria
- implicit enumeration
- continuous relaxation
- hamming distance
- np hard problems
- maximum profit
- feasible solution
- computational efficiency
- worst case
- multi objective