Solving binary multi-objective knapsack problems with novel greedy strategy.
Jiawei YuanYifan LiPublished in: Memetic Comput. (2021)
Keyphrases
- knapsack problem
- multi objective
- greedy strategy
- greedy algorithm
- nsga ii
- multiple objectives
- randomly generated test instances
- implicit enumeration
- objective function
- evolutionary algorithm
- binary variables
- multi objective optimization
- optimization problems
- combinatorial optimization problems
- optimization algorithm
- test problems
- linear programming relaxation
- linear relaxation
- production planning
- exact algorithms
- particle swarm optimization
- optimal solution
- integer variables
- multi objective optimization problems
- linear programming problems
- genetic algorithm
- dynamic programming
- np hard
- np hard problems
- combinatorial optimization
- maximum profit
- neural network
- bicriteria
- cutting plane
- lower bound
- worst case