A two state reduction based dynamic programming algorithm for the bi-objective 0-1 knapsack problem.
Aiying RongJosé Rui FigueiraMargarida Vaz PatoPublished in: Comput. Math. Appl. (2011)
Keyphrases
- knapsack problem
- bi objective
- optimization problems
- multiple objectives
- combinatorial optimization problems
- optimal solution
- dynamic programming
- test problems
- multi objective
- exact algorithms
- evolutionary algorithm
- efficient solutions
- multidimensional knapsack problem
- multi objective optimization
- nsga ii
- greedy algorithm
- np hard
- linear programming relaxation
- heuristic solution
- tabu search
- shortest path problem
- optimization algorithm
- simulated annealing
- reinforcement learning