Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method.
Vincent C. LiYun-Chia LiangHuan-Fu ChangPublished in: Comput. Oper. Res. (2012)
Keyphrases
- projection method
- upper bound
- multidimensional knapsack problem
- lower and upper bounds
- lower bound
- harmonic functions
- worst case
- constraint satisfaction
- integer program
- artificial neural networks
- tabu search
- genetic algorithm
- branch and bound algorithm
- constrained optimization
- combinatorial optimization
- adaptive learning
- branch and bound
- mathematical model
- dynamic programming
- reinforcement learning