On branching heuristics for the bi-objective 0/1 unidimensional knapsack problem.
Audrey CerqueusXavier GandibleuxAnthony PrzybylskiFrédéric SaubionPublished in: J. Heuristics (2017)
Keyphrases
- worst case
- knapsack problem
- bi objective
- np hard
- greedy algorithm
- exact algorithms
- greedy heuristic
- randomly generated test instances
- heuristic solution
- combinatorial optimization problems
- optimal solution
- hybrid algorithms
- test problems
- multiple objectives
- dynamic programming
- approximation algorithms
- optimization problems
- branch and bound
- nsga ii
- heuristic methods
- multidimensional knapsack problem
- efficient solutions
- special case
- linear programming relaxation
- search algorithm
- multi objective optimization
- genetic algorithm
- evolutionary algorithm
- multi objective
- search strategies