Online Knapsack Problem Under Concave Functions.
Xin HanNing MaKazuhisa MakinoHe ChenPublished in: FAW (2017)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- test problems
- optimization problems
- optimal solution
- online learning
- linear programming relaxation
- np hard
- greedy algorithm
- multidimensional knapsack problem
- heuristic solution
- dynamic programming
- binary variables
- objective function
- continuous relaxation
- exact algorithms
- np hard problems
- bicriteria
- multiple objectives
- greedy heuristic
- implicit enumeration
- decision variables
- scheduling problem
- maximum profit