Exact algorithms for the 0-1 Time-Bomb Knapsack Problem.
Michele MonaciCiara Pike-BurkeAlberto SantiniPublished in: Comput. Oper. Res. (2022)
Keyphrases
- exact algorithms
- knapsack problem
- combinatorial optimization problems
- optimal solution
- vehicle routing problem with time windows
- benders decomposition
- optimization problems
- dynamic programming
- np hard
- multidimensional knapsack problem
- greedy algorithm
- linear programming relaxation
- greedy heuristic
- continuous relaxation
- bicriteria
- cutting plane
- learning algorithm
- vehicle routing problem
- maximum profit
- approximation algorithms
- traveling salesman problem
- cellular automata
- tabu search
- upper bound
- objective function