Pages that link to "Item:Q1119489"
From MaRDI portal
The following pages link to Algorithms to solve the orienteering problem: A comparison (Q1119489):
Displayed 10 items.
- A heuristic approach for the travelling purchaser problem (Q707139) (← 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)
- Using artificial neural networks to solve the orienteering problem (Q1908298) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Multiobjective transportation network design and routing problems: Taxonomy and annotation (Q2368289) (← links)