Approximation Algorithms for Orienteering and Discounted-Reward TSP
From MaRDI portal
Recommendations
Cited in
(62)- An adaptive large neighborhood search for relocating vehicles in electric carsharing services
- Discounted reward TSP
- Tour recommendation for groups
- Heuristic algorithms for the operator-based relocation problem in one-way electric carsharing systems
- Serving rides of equal importance for time-limited dial-a-ride
- A constant-factor approximation for directed latency in quasi-polynomial time
- Faster algorithms for orienteering and \(k\)-TSP
- UAV routing for reconnaissance mission: a multi-objective orienteering problem with time-dependent prizes and multiple connections
- Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems
- Delivery route optimization with automated vehicle in smart urban environment
- Informative path planning as a maximum traveling salesman problem with submodular rewards
- Approximation algorithms for the directed \(k\)-Tour and \(k\)-Stroll problems
- Compact, provably-good LPs for orienteering and regret-bounded vehicle routing
- Orienteering for electioneering
- Pruning 2-connected graphs
- Approximation algorithms for the traveling repairman and speeding deliveryman problems
- Complexity and approximation for traveling salesman problems with profits
- Grasp and delivery for moving objects on broken lines
- Two multi-start heuristics for the \(k\)-traveling salesman problem
- Solving TSP through the integration of OR and CP techniques
- Capacitated vehicle routing with nonuniform speeds
- Approximation algorithms for distance constrained vehicle routing problems
- Dynamic traveling repair problem with an arbitrary time window
- Capacitated vehicle routing with non-uniform speeds
- Exploring and triangulating a region by a swarm of robots
- On maximum discounted effort reward search problem
- Improved algorithms for orienteering and related problems
- The Directed Minimum Latency Problem
- Discrete online TSP
- The school bus problem on trees
- Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
- Approximation algorithms for the arc orienteering problem
- scientific article; zbMATH DE number 1839476 (Why is no real title available?)
- The capacitated orienteering problem
- Stochastic graph exploration
- The robot routing problem for collecting aggregate stochastic rewards
- Approximation algorithms for stochastic k-TSP
- Running Errands in Time: Approximation Algorithms for Stochastic Orienteering
- The directed orienteering problem
- scientific article; zbMATH DE number 7053373 (Why is no real title available?)
- Reducing Path TSP to TSP
- A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time
- Improving the approximation ratio for capacitated vehicle routing
- New approximation algorithms for the rooted budgeted cycle cover problem
- Improving the approximation ratio for capacitated vehicle routing
- New approximation algorithms for the rooted budgeted cycle cover problem
- Beating the Integrality Ratio for $s$-$t$-Tours in Graphs
- An improved approximation guarantee for prize-collecting TSP
- Simple heuristics for the rooted max tree coverage problem
- Algorithms for the thief orienteering problem on directed acyclic graphs
- Maximizing the number of rides served for time-limited Dial-a-Ride*
- Approximation algorithms for correlated knapsack orienteering
- A survey on approximability of traveling salesman problems using the TSP-T3CO definition scheme
- Autonomous data detection and inspection with a fleet of UAVs
- Multi-objective route planning of an unmanned air vehicle in continuous terrain: an exact and an approximation algorithm
- Maximizing rides served for dial-a-ride on the uniform metric
- Planning in hierarchical reinforcement learning: guarantees for using local policies
- A better-than-1.6-approximation for prize-collecting TSP
- A better-than-1.6-approximation for prize-collecting TSP
- Constant-factor approximation to deadline TSP and related problems in (almost) quasi-polytime
- Approximation schemes for orienteering and deadline TSP in doubling metrics
- On the adaptivity gap of stochastic orienteering
This page was built for publication: Approximation Algorithms for Orienteering and Discounted-Reward TSP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5386217)
