Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem.
Charles DelortOlivier SpanjaardPublished in: SEA (2010)
Keyphrases
- knapsack problem
- bi objective
- multiobjective optimization
- multi objective
- multiple objectives
- nsga ii
- combinatorial optimization problems
- min max
- evolutionary algorithm
- multi objective optimization
- pareto frontier
- test problems
- dynamic programming
- optimal solution
- swarm intelligence
- efficient solutions
- lower bound
- set covering problem
- greedy algorithm
- np hard
- exact algorithms
- pareto optimal solutions
- artificial immune system
- shortest path problem