Pages that link to "Item:Q4030787"

The following pages link to An Optimal Algorithm for the Orienteering Tour Problem (Q4030787):

Displaying 26 items.

• The clustered orienteering problem (Q296772) (← links)
• A two-stage approach to the orienteering problem with stochastic weights (Q336923) (← links)
• The orienteering problem: a survey (Q617509) (← links)
• Heuristic algorithms for visiting the customers in a rolling schedule environment (Q850656) (← links)
• Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming (Q958452) (← links)
• A path relinking approach for the team orienteering problem (Q975993) (← 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 heuristic for the multiple tour maximum collection problem (Q1317095) (← 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)
• Managing platelet supply through improved routing of blood collection vehicles (Q1651648) (← links)
• A TABU search heuristic for the team orienteering problem (Q1764755) (← links)
• Using artificial neural networks to solve the orienteering problem (Q1908298) (← links)
• Routing problems: A bibliography (Q1908308) (← 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)
• A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times (Q2270448) (← links)
• A guided local search metaheuristic for the team orienteering problem (Q2378455) (← links)
• Evolution-inspired local improvement algorithm solving orienteering problem (Q2399337) (← links)
• A stabilized column generation scheme for the traveling salesman subtour problem (Q2433808) (← links)
• A note on relatives to the Held and Karp 1-tree problem (Q2494821) (← links)
• A two-stage vehicle routing model for large-scale bioterrorism emergencies (Q3057125) (← links)
• Locating a cycle in a transportation or a telecommunications network (Q3593375) (← links)
• A revisited branch-and-cut algorithm for large-scale orienteering problems (Q6087525) (← links)