Corrigendum to "A New Formulation and a Branch-and-Cut Algorithm for the Set Orienteering Problem" [European Journal of Operational Research, Volume 314, Issue 2, 16 April 2024, Pages 446-465].
Claudia ArchettiFrancesco CarrabsRaffaele CerulliFederica LaureanaPublished in: Eur. J. Oper. Res. (2024)
Keyphrases
- detection algorithm
- optimization algorithm
- preprocessing
- learning algorithm
- times faster
- objective function
- initial set
- recognition algorithm
- computational cost
- dynamic programming
- worst case
- high accuracy
- k means
- cost function
- experimental evaluation
- similarity measure
- segmentation algorithm
- minimum length
- quadratic programming
- convex hull
- image set
- knapsack problem
- solution space
- lower and upper bounds
- matching algorithm
- clustering method
- support vector machine
- probabilistic model
- evolutionary algorithm
- search space
- computational complexity
- optimal solution
- feature selection
- search engine