Online Knapsack Problems with a Resource Buffer.
Xin HanYasushi KawaseKazuhisa MakinoHaruki YokomakuPublished in: ISAAC (2019)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- linear programming relaxation
- optimization problems
- dynamic programming
- test problems
- np hard
- online learning
- optimal solution
- resource allocation
- real time
- greedy algorithm
- continuous relaxation
- np hard problems
- exact algorithms
- production planning
- branch and bound algorithm
- multi objective
- bicriteria
- lower bound
- neural network