Online knapsack problem under concave functions.
Xin HanQinyang ChenKazuhisa MakinoPublished in: Theor. Comput. Sci. (2019)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- optimal solution
- optimization problems
- binary variables
- test problems
- objective function
- linear programming relaxation
- exact algorithms
- np hard
- online learning
- multidimensional knapsack problem
- dynamic programming
- bicriteria
- continuous relaxation
- greedy algorithm
- neural network
- maximum profit
- np hard problems
- implicit enumeration
- greedy heuristic
- piecewise linear
- multiple objectives
- decision variables
- lower bound
- computational complexity