Pages that link to "Item:Q5386217"

The following pages link to Approximation Algorithms for Orienteering and Discounted-Reward TSP (Q5386217):

Displaying 49 items.

• The school bus problem on trees (Q378249) (← links)
• Hybridized evolutionary local search algorithm for the team orienteering problem with time windows (Q415560) (← links)
• Approximation algorithms for the arc orienteering problem (Q477675) (← links)
• The capacitated orienteering problem (Q496434) (← links)
• The directed orienteering problem (Q547309) (← links)
• On the adaptivity gap of stochastic orienteering (Q896283) (← links)
• An adaptive large neighborhood search for relocating vehicles in electric carsharing services (Q1634774) (← links)
• Discounted reward TSP (Q1709577) (← links)
• Tour recommendation for groups (Q1741326) (← links)
• Heuristic algorithms for the operator-based relocation problem in one-way electric carsharing systems (Q1751207) (← links)
• Serving rides of equal importance for time-limited dial-a-ride (Q2117614) (← links)
• A constant-factor approximation for directed latency in quasi-polynomial time (Q2119400) (← links)
• Faster algorithms for orienteering and \(k\)-TSP (Q2124233) (← links)
• UAV routing for reconnaissance mission: a multi-objective orienteering problem with time-dependent prizes and multiple connections (Q2147172) (← 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)
• Approximation algorithms for the directed \(k\)-Tour and \(k\)-Stroll problems (Q2392924) (← links)
• Compact, provably-good LPs for orienteering and regret-bounded vehicle routing (Q2401157) (← 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)
• Grasp and delivery for moving objects on broken lines (Q2481562) (← links)
• Two multi-start heuristics for the \(k\)-traveling salesman problem (Q2656560) (← links)
• Solving TSP through the integration of OR and CP techniques (Q2741259) (← links)
• Capacitated vehicle routing with nonuniform speeds (Q2800377) (← links)
• Approximation algorithms for distance constrained vehicle routing problems (Q2892157) (← links)
• Dynamic Traveling Repair Problem with an Arbitrary Time Window (Q2971153) (← links)
• Capacitated Vehicle Routing with Non-uniform Speeds (Q3009766) (← links)
• Exploring and Triangulating a Region by a Swarm of Robots (Q3088095) (← links)
• On Maximum Discounted Effort Reward Search Problem (Q3188766) (← links)
• The Directed Minimum Latency Problem (Q3541796) (← links)
• Discrete online TSP (Q3638442) (← links)
• (Q4782745) (← links)
• Stochastic graph exploration (Q5092339) (← links)
• The Robot Routing Problem for Collecting Aggregate Stochastic Rewards (Q5111626) (← links)
• (Q5136319) (← links)
• Running Errands in Time: Approximation Algorithms for Stochastic Orienteering (Q5245015) (← links)
• (Q5743496) (← links)
• Reducing Path TSP to TSP (Q5860476) (← links)
• A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time (Q5874522) (← links)
• Improving the approximation ratio for capacitated vehicle routing (Q5918417) (← links)
• New approximation algorithms for the rooted budgeted cycle cover problem (Q5918725) (← links)
• Improving the approximation ratio for capacitated vehicle routing (Q5925635) (← links)
• New approximation algorithms for the rooted budgeted cycle cover problem (Q5925709) (← links)
• Beating the Integrality Ratio for $s$-$t$-Tours in Graphs (Q6139824) (← links)
• Simple heuristics for the rooted max tree coverage problem (Q6606188) (← links)
• Algorithms for the thief orienteering problem on directed acyclic graphs (Q6652432) (← links)
• Maximizing the number of rides served for time-limited Dial-a-Ride* (Q6661115) (← links)