Implementing an efficient fptas for the 0-1 multi-objective knapsack problem.
Cristina BazganHadrien HugotDaniel VanderpootenPublished in: Eur. J. Oper. Res. (2009)
Keyphrases
- knapsack problem
- multi objective
- pareto optimal
- multiple objectives
- nsga ii
- optimization problems
- evolutionary algorithm
- test problems
- optimal solution
- combinatorial optimization problems
- bi objective
- dynamic programming
- objective function
- multi objective optimization
- greedy algorithm
- optimization algorithm
- multidimensional knapsack problem
- multi objective optimization problems
- bicriteria
- np hard problems
- continuous relaxation
- np hard
- genetic algorithm
- exact algorithms
- particle swarm optimization
- heuristic solution
- linear programming relaxation
- maximum profit
- integer programming
- implicit enumeration
- decision variables
- simulated annealing
- combinatorial optimization