Integrating partial optimization with scatter search for solving bi-criteria {0, 1}-knapsack problems.
Carlos Gomes da SilvaJosé Rui FigueiraJoão C. N. ClímacoPublished in: Eur. J. Oper. Res. (2007)
Keyphrases
- knapsack problem
- scatter search
- optimization problems
- metaheuristic
- bicriteria
- combinatorial optimization
- nsga ii
- optimal solution
- path relinking
- implicit enumeration
- combinatorial optimization problems
- evolutionary algorithm
- tabu search
- test problems
- multiple objectives
- objective function
- exact algorithms
- ant colony optimization
- lp relaxation
- traveling salesman problem
- routing problem
- benchmark problems
- vehicle routing problem
- dynamic programming
- linear programming relaxation
- cost function
- optimization algorithm
- multi objective
- np hard
- simulated annealing
- cutting plane
- efficient solutions
- search space
- branch and bound
- greedy algorithm
- global optimization
- shortest path problem
- quality of service
- linear programming