On the Re-Solving Heuristic for (Binary) Contextual Bandits with Knapsacks.
Rui AiZhaohua ChenXiaotie DengYuqi PanChang WangMingwei YangPublished in: CoRR (2022)
Keyphrases
- combinatorial optimization
- timetabling problem
- finding an optimal solution
- contextual information
- knapsack problem
- search heuristics
- simulated annealing
- variable ordering
- optimal solution
- search algorithm
- sliding tile
- beam search
- dynamic programming
- exact algorithms
- stochastic local search
- tabu search
- sparse matrices
- evolutionary algorithm