A new formulation and a branch-and-cut algorithm for the set orienteering problem.
Claudia ArchettiFrancesco CarrabsRaffaele CerulliFederica LaureanaPublished in: Eur. J. Oper. Res. (2024)
Keyphrases
- initial set
- detection algorithm
- preprocessing
- conflict free
- experimental evaluation
- computational complexity
- k means
- cost function
- improved algorithm
- learning algorithm
- optimization algorithm
- significant improvement
- computational cost
- knapsack problem
- times faster
- input data
- computationally efficient
- decomposition algorithm
- matching algorithm
- particle swarm optimization
- segmentation algorithm
- worst case
- dynamic programming
- objective function
- similarity measure
- image sequences
- expectation maximization
- linear programming
- tree structure
- high accuracy
- convex hull
- probabilistic model
- solution space
- semidefinite programming
- iterative procedure