Solving 0-1 knapsack problem by a novel binary monarch butterfly optimization.
Yanhong FengGai-Ge WangSuash DebMei LuXiang-Jun ZhaoPublished in: Neural Comput. Appl. (2017)
Keyphrases
- knapsack problem
- optimization problems
- implicit enumeration
- randomly generated test instances
- combinatorial optimization problems
- multiple objectives
- decision variables
- binary variables
- combinatorial optimization
- linear relaxation
- optimal solution
- test problems
- linear programming relaxation
- linear programming problems
- integer variables
- exact algorithms
- np hard
- quadratic program
- multidimensional knapsack problem
- evolutionary algorithm
- dynamic programming
- maximum profit
- lp relaxation
- objective function
- optimization algorithm
- cutting plane
- bicriteria
- metaheuristic
- neural network
- convex optimization
- search algorithm
- branch and bound
- continuous relaxation
- computational complexity