Solving efficiently the 0-1 multi-objective knapsack problem.
Cristina BazganHadrien HugotDaniel VanderpootenPublished in: Comput. Oper. Res. (2009)
Keyphrases
- knapsack problem
- multi objective
- multiple objectives
- randomly generated test instances
- implicit enumeration
- optimization problems
- nsga ii
- evolutionary algorithm
- combinatorial optimization problems
- bi objective
- optimal solution
- multi objective optimization
- exact algorithms
- integer variables
- test problems
- dynamic programming
- linear relaxation
- optimization algorithm
- linear programming problems
- greedy algorithm
- lp relaxation
- objective function
- linear programming relaxation
- np hard
- cutting plane
- greedy heuristic
- multidimensional knapsack problem
- combinatorial optimization
- multi objective optimization problems
- particle swarm optimization
- genetic algorithm
- bicriteria
- metaheuristic