Pages that link to "Item:Q1266618"
From MaRDI portal
The following pages link to A fast and effective heuristic for the orienteering problem (Q1266618):
Displaying 15 items.
- The orienteering problem (Q3792511) (← links)
- A multifaceted heuristic for the orienteering problem (Q3795496) (← links)
- An Optimal Algorithm for the Orienteering Tour Problem (Q4030787) (← links)
- An iterated local search algorithm for the team orienteering problem with variable profits (Q5058860) (← links)
- The orienteering problem with variable profits (Q5326782) (← links)
- Solving Relaxation Orienteering Problem Using DCA-CUT (Q5356984) (← links)
- A Memetic-GRASP Algorithm for the Solution of the Orienteering Problem (Q5357744) (← links)
- Variable neighborhood search to solve the generalized orienteering problem (Q6070415) (← links)
- Recent advances in integrating demand management and vehicle routing: a methodological review (Q6109246) (← links)
- An adaptive memory matheuristic for the set orienteering problem (Q6112827) (← links)
- Hybrid genetic algorithm for undirected traveling salesman problems with profits (Q6139377) (← links)
- A new mathematical model and a heuristic algorithm for the tourist trip design problem under new constraints: a real-world application (Q6191670) (← links)
- The daily swab test collection problem (Q6547116) (← links)
- An effective hybrid evolutionary algorithm for the clustered orienteering problem (Q6555127) (← links)
- UAV path planning techniques: a survey (Q6658423) (← links)