Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem.
Hyunjoon KimByung-In KimPublished in: Eur. J. Oper. Res. (2022)
Keyphrases
- dynamic programming
- learning algorithm
- detection algorithm
- search space
- significant improvement
- experimental evaluation
- optimization algorithm
- high accuracy
- np hard
- knapsack problem
- times faster
- improved algorithm
- linear programming
- objective function
- expectation maximization
- computationally efficient
- scan line
- matching algorithm
- locally optimal
- particle swarm optimization
- maximum likelihood
- worst case
- probabilistic model
- computational cost
- preprocessing
- computational complexity
- similarity measure