Development of a hybrid dynamic programming approach for solving discrete nonlinear knapsack problems.
Farhad Ghassemi TariEshagh JahangiriPublished in: Appl. Math. Comput. (2007)
Keyphrases
- knapsack problem
- dynamic programming
- implicit enumeration
- integer variables
- combinatorial optimization problems
- randomly generated test instances
- greedy algorithm
- continuous relaxation
- exact algorithms
- optimization problems
- piecewise linear
- test problems
- linear relaxation
- markov decision processes
- software engineering
- production planning
- reinforcement learning
- np hard
- dynamic programming algorithms
- state space
- nonlinear equations
- genetic algorithm
- combinatorial optimization
- optimal solution
- markov decision problems
- linear programming relaxation
- cutting plane
- lagrangian relaxation
- neural network