On Local Search for Bi-objective Knapsack Problems.
Arnaud LiefoogheLuís PaqueteJosé Rui FigueiraPublished in: Evol. Comput. (2013)
Keyphrases
- knapsack problem
- bi objective
- pareto local search
- optimal solution
- set covering problem
- multiple objectives
- combinatorial optimization problems
- dynamic programming
- np hard
- optimization problems
- test problems
- hybrid algorithms
- exact algorithms
- linear programming relaxation
- efficient solutions
- greedy algorithm
- search algorithm
- search space
- nsga ii
- metaheuristic
- memetic algorithm
- tabu search
- maximum profit
- neighborhood search
- genetic algorithm
- combinatorial optimization
- shortest path problem
- evolutionary algorithm
- objective function
- learning algorithm
- search strategies
- branch and bound
- implicit enumeration
- neural network