The following pages link to (Q3579451):
Displaying 15 items.
- The clustered orienteering problem (Q296772) (← links)
- Optimal deterministic algorithms for some variants of online quota traveling salesman problem (Q296870) (← links)
- Orienteering problem: a survey of recent variants, solution approaches and applications (Q323527) (← links)
- The school bus problem on trees (Q378249) (← links)
- Hybridized evolutionary local search algorithm for the team orienteering problem with time windows (Q415560) (← links)
- The capacitated orienteering problem (Q496434) (← links)
- The directed orienteering problem (Q547309) (← links)
- Approximation algorithms for the directed \(k\)-Tour and \(k\)-Stroll problems (Q2392924) (← links)
- Pruning 2-connected graphs (Q2428662) (← links)
- Approximation algorithms for the traveling repairman and speeding deliveryman problems (Q2428683) (← links)
- Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems (Q3009753) (← links)
- Capacitated Vehicle Routing with Non-uniform Speeds (Q3009766) (← links)
- The Directed Minimum Latency Problem (Q3541796) (← links)
- (Q5743496) (← links)
- A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs (Q5900474) (← links)
