Pages that link to "Item:Q1119489"

The following pages link to Algorithms to solve the orienteering problem: A comparison (Q1119489):

Displaying 20 items.

• The clustered orienteering problem (Q296772) (← links)
• The orienteering problem: a survey (Q617509) (← links)
• A heuristic approach for the travelling purchaser problem (Q707139) (← links)
• A path relinking approach for the team orienteering problem (Q975993) (← links)
• Design and analysis of stochastic local search for the multiobjective traveling salesman problem (Q1010272) (← links)
• The traveling purchaser problem with budget constraint (Q1013406) (← links)
• A fast and effective heuristic for the orienteering problem (Q1266618) (← links)
• Minimum directed 1-subtree relaxation for score orienteering problem (Q1291640) (← links)
• An efficient composite heuristic for the symmetric generalized traveling salesman problem (Q1296792) (← links)
• Strong linear programming relaxations for the orienteering problem (Q1328645) (← links)
• A TSSP+1 decomposition strategy for the vehicle routing problem (Q1342652) (← links)
• A tabu search heuristic for the undirected selective travelling salesman problem (Q1609914) (← links)
• Managing platelet supply through improved routing of blood collection vehicles (Q1651648) (← links)
• Using artificial neural networks to solve the orienteering problem (Q1908298) (← links)
• Routing problems: A bibliography (Q1908308) (← links)
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search (Q1926697) (← links)
• A Tabu search algorithm for the probabilistic orienteering problem (Q2026967) (← links)
• An effective PSO-inspired algorithm for the team orienteering problem (Q2355862) (← links)
• Multiobjective transportation network design and routing problems: Taxonomy and annotation (Q2368289) (← links)
• Trip planning for visitors in a service system with capacity constraints (Q2676374) (← links)