The following pages link to (Q3792511):
Displayed 23 items.
- Heuristic algorithms for visiting the customers in a rolling schedule environment (Q850656) (← links)
- The selective travelling salesman problem (Q910347) (← links)
- Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming (Q958452) (← links)
- On symmetric subtour problems (Q1202764) (← links)
- The team orienteering problem (Q1266617) (← 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)
- A constant-factor approximation algorithm for the \(k\)-MST problem (Q1305925) (← links)
- A heuristic for the multiple tour maximum collection problem (Q1317095) (← links)
- The median tour and maximal covering tour problems: Formulations and heuristics (Q1328602) (← links)
- Strong linear programming relaxations for the orienteering problem (Q1328645) (← links)
- A TSSP+1 decomposition strategy for the vehicle routing problem (Q1342652) (← links)
- The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm (Q1590800) (← links)
- A tabu search heuristic for the undirected selective travelling salesman problem (Q1609914) (← links)
- A TABU search heuristic for the team orienteering problem (Q1764755) (← links)
- Approximation algorithms for time-dependent orienteering. (Q1853044) (← links)
- Using artificial neural networks to solve the orienteering problem (Q1908298) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- A guided local search metaheuristic for the team orienteering problem (Q2378455) (← links)
- The traveling group problem (Q2385125) (← links)
- A stabilized column generation scheme for the traveling salesman subtour problem (Q2433808) (← links)
- A comparison of heuristics for the problem of batching orders for warehouse selection (Q4230089) (← links)