A reduction dynamic programming algorithm for the bi-objective integer knapsack problem.
Aiying RongJosé Rui FigueiraPublished in: Eur. J. Oper. Res. (2013)
Keyphrases
- knapsack problem
- bi objective
- minimum cost flow
- integer variables
- decision variables
- combinatorial optimization problems
- continuous relaxation
- multiple objectives
- optimization problems
- optimal solution
- dynamic programming
- heuristic solution
- multidimensional knapsack problem
- test problems
- exact algorithms
- implicit enumeration
- np hard
- greedy algorithm
- linear programming relaxation
- nsga ii
- shortest path problem
- neural network
- evolutionary algorithm
- multi objective
- metaheuristic
- learning algorithm