Time Fairness in Online Knapsack Problems.
Adam LechowiczRik SenguptaBo SunShahin KamaliMohammad HajiesmailiPublished in: CoRR (2023)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- optimal solution
- dynamic programming
- test problems
- greedy algorithm
- linear programming relaxation
- optimization problems
- online learning
- neural network
- np hard
- production planning
- continuous relaxation
- genetic algorithm
- exact algorithms
- cutting plane
- real time
- greedy algorithms
- maximum profit