A penalty algorithm for solving convex separable knapsack problems.
Robinson S. V. HotoLuiz Carlos MatioliPaulo Sérgio Marques dos SantossPublished in: Appl. Math. Comput. (2020)
Keyphrases
- knapsack problem
- objective function
- optimal solution
- bicriteria
- quadratic optimization problems
- dynamic programming
- computational complexity
- learning algorithm
- convex hull
- np hard
- test problems
- worst case
- optimization algorithm
- implicit enumeration
- cost function
- reinforcement learning
- computational efficiency
- solution quality
- upper bound
- globally optimal
- exact solution
- greedy algorithms
- special case