Connectedness and Local Search for Bicriteria Knapsack Problems.
Arnaud LiefoogheLuís PaqueteMarco SimõesJosé Rui FigueiraPublished in: EvoCOP (2011)
Keyphrases
- bicriteria
- knapsack problem
- optimal solution
- combinatorial optimization problems
- optimization problems
- search algorithm
- np hard
- test problems
- dynamic programming
- search space
- combinatorial optimization
- efficient solutions
- metaheuristic
- simulated annealing
- lower bound
- linear programming relaxation
- tabu search
- multiple objectives
- genetic algorithm
- greedy algorithm
- objective function
- linear programming
- cutting plane
- feasible solution
- solution quality
- evolutionary algorithm
- shortest path problem
- branch and bound algorithm