The following pages link to (Q2956989):
Displaying 24 items.
- Efficient meta-heuristics for the multi-objective time-dependent orienteering problem (Q323359) (← links)
- Orienteering problem: a survey of recent variants, solution approaches and applications (Q323527) (← links)
- Scheduled penalty variable neighborhood search (Q337204) (← links)
- Solving the orienteering problem with time windows via the pulse framework (Q337360) (← links)
- A tabu search algorithm for the multi-period inspector scheduling problem (Q337536) (← links)
- Heuristics for the time dependent team orienteering problem: application to tourist route planning (Q337623) (← links)
- The capacitated team orienteering problem with incomplete service (Q375974) (← links)
- Hybridized evolutionary local search algorithm for the team orienteering problem with time windows (Q415560) (← links)
- A simulated annealing heuristic for the team orienteering problem with time windows (Q439335) (← links)
- The orienteering problem: a survey (Q617509) (← links)
- Iterated local search for the team orienteering problem with time windows (Q833556) (← links)
- Bi-objective orienteering for personal activity scheduling (Q1652268) (← links)
- Formulations for the orienteering problem with additional constraints (Q1686508) (← links)
- A unified matheuristic for solving multi-constrained traveling salesman problems with profits (Q1707083) (← links)
- The team orienteering problem with time windows: an LP-based granular variable neighborhood search (Q1926697) (← links)
- Coupling ant colony systems with strong local searches (Q1926808) (← links)
- A Tabu search algorithm for the probabilistic orienteering problem (Q2026967) (← links)
- Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem (Q2158007) (← links)
- Deep infeasibility exploration method for vehicle routing problems (Q2163783) (← links)
- An iterative three-component heuristic for the team orienteering problem with time windows (Q2255940) (← links)
- Multi-period orienteering with uncertain adoption likelihood and waiting at customers (Q2282513) (← links)
- Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows (Q2664372) (← links)
- A Memetic-GRASP Algorithm for the Solution of the Orienteering Problem (Q5357744) (← links)
- A new mathematical model and a heuristic algorithm for the tourist trip design problem under new constraints: a real-world application (Q6191670) (← links)
