A revisited branch-and-cut algorithm for large-scale orienteering problems.
Gorka KobeagaJairo Rojas-DelgadoMaría MerinoJosé Antonio LozanoPublished in: Eur. J. Oper. Res. (2024)
Keyphrases
- improved algorithm
- optimization algorithm
- dynamic programming
- search space
- cost function
- experimental evaluation
- computational complexity
- preprocessing
- learning algorithm
- times faster
- probabilistic model
- computationally efficient
- matching algorithm
- input data
- high accuracy
- linear systems
- iterative algorithms
- transportation problem
- knapsack problem
- expectation maximization
- test problems
- classification algorithm
- detection algorithm
- optimization problems
- worst case
- k means
- similarity measure
- theoretical analysis
- np complete
- path planning
- convergence rate
- simulated annealing
- np hard
- optimal solution