Pages that link to "Item:Q3580966"

The following pages link to Approximation algorithms for deadline-TSP and vehicle routing with time-windows (Q3580966):

Displaying 38 items.

• The orienteering problem with time windows applied to robotic melon harvesting (Q255095) (← links)
• TSP race: minimizing completion time in time-sensitive applications (Q319282) (← links)
• Approximation schemes for Euclidean vehicle routing problems with time windows (Q346518) (← links)
• The school bus problem on trees (Q378249) (← links)
• The capacitated orienteering problem (Q496434) (← links)
• The directed orienteering problem (Q547309) (← links)
• Set covering in fuel-considered vehicle routing problems (Q896127) (← links)
• On the adaptivity gap of stochastic orienteering (Q896283) (← links)
• Discounted reward TSP (Q1709577) (← links)
• Tour recommendation for groups (Q1741326) (← links)
• Spider covers and their applications (Q1935978) (← links)
• The online food delivery problem on stars (Q2079861) (← links)
• Approximation algorithms for some extensions of the maximum profit routing problem (Q2105889) (← links)
• Faster algorithms for orienteering and \(k\)-TSP (Q2124233) (← links)
• Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems (Q2164695) (← links)
• Delivery route optimization with automated vehicle in smart urban environment (Q2193271) (← links)
• An approximation algorithm for vehicle routing with compatibility constraints (Q2294242) (← links)
• Approximation algorithms for the directed \(k\)-Tour and \(k\)-Stroll problems (Q2392924) (← links)
• Adversarial patrolling with spatially uncertain alarm signals (Q2407886) (← links)
• Orienteering for electioneering (Q2417102) (← links)
• Pruning 2-connected graphs (Q2428662) (← links)
• Approximation algorithms for the traveling repairman and speeding deliveryman problems (Q2428683) (← links)
• Complexity and approximation for traveling salesman problems with profits (Q2441781) (← links)
• The parameterized approximability of TSP with deadlines (Q2464332) (← links)
• Grasp and delivery for moving objects on broken lines (Q2481562) (← links)
• Approximating a vehicle scheduling problem with time windows and handling times (Q2481960) (← links)
• The multiple TSP with time windows: vehicle bounds based on precedence graphs (Q2583718) (← links)
• Dynamic Traveling Repair Problem with an Arbitrary Time Window (Q2971153) (← links)
• The Robot Routing Problem for Collecting Aggregate Stochastic Rewards (Q5111626) (← links)
• Running Errands in Time: Approximation Algorithms for Stochastic Orienteering (Q5245015) (← links)
• (Q5743496) (← links)
• New approximation algorithms for the rooted budgeted cycle cover problem (Q5918725) (← links)
• Deadline TSP (Q5925174) (← links)
• New approximation algorithms for the rooted budgeted cycle cover problem (Q5925709) (← links)
• Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows (Q6160235) (← links)
• Vehicle routing with time-dependent travel times: theory, practice, and benchmarks (Q6602334) (← links)
• Simple heuristics for the rooted max tree coverage problem (Q6606188) (← links)
• Earliest deadline first is a 2-approximation for DARP with time windows (Q6606221) (← links)