Dynamic programming algorithms for the bi-objective integer knapsack problem.
Aiying RongJosé Rui FigueiraPublished in: Eur. J. Oper. Res. (2014)
Keyphrases
- knapsack problem
- bi objective
- dynamic programming algorithms
- dynamic programming
- integer variables
- decision variables
- continuous relaxation
- multiple objectives
- combinatorial optimization problems
- test problems
- greedy algorithm
- optimization problems
- optimal solution
- state space
- exact algorithms
- optimal policy
- nsga ii
- learning algorithm
- reinforcement learning
- machine learning
- markov decision processes
- np hard
- network design
- shortest path problem
- np complete problems
- computational complexity
- objective function
- multi objective
- neural network
- linear programming