Algorithm selection for the team orienteering problem
From MaRDI portal
Recommendations
- An exact algorithm for team orienteering problems
- A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem
- A branch-and-cut algorithm for the team orienteering problem
- On a model and optimization algorithms for a dynamic team orienteering problem
- A TABU search heuristic for the team orienteering problem
- Algorithms to solve the orienteering problem: A comparison
- An effective PSO-inspired algorithm for the team orienteering problem
- A memetic algorithm for the team orienteering problem
Cites work
- A TABU search heuristic for the team orienteering problem
- A guided local search metaheuristic for the team orienteering problem
- A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
- A memetic algorithm for the team orienteering problem
- A path relinking approach for the team orienteering problem
- An effective PSO-inspired algorithm for the team orienteering problem
- Iterated local search for the team orienteering problem with time windows
- Orienteering problem: a survey of recent variants, solution approaches and applications
- Random forests
- SATzilla: portfolio-based algorithm selection for SAT
- Singular value decomposition and least squares solutions
- Tabu Search—Part I
- Tabu Search—Part II
- The orienteering problem
- The team orienteering problem
- The team orienteering problem: formulations and branch-cut and price
- Variable neighborhood search
- Variable neighborhood search: basics and variants
- \textsc{Alors}: an algorithm recommender system
Cited in
(2)
This page was built for publication: Algorithm selection for the team orienteering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2163778)