Approximation algorithms for distance constrained vehicle routing problems
From MaRDI portal
Cites work
- A new approximation algorithm for the capacitated vehicle routing problem on a tree
- Approximating the \(k\)-traveling repairman problem with repair times
- Approximation Algorithms for Orienteering and Discounted-Reward TSP
- Approximation algorithms for some vehicle routing problems
- Approximations for minimum and min-max vehicle routing problems
- Bin packing can be solved within 1+epsilon in linear time
- Capacitated Vehicle Routing on Trees
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Minimum Vehicle Routing with a Common Deadline
- On the Distance Constrained Vehicle Routing Problem
- Preemptive Ensemble Motion Planning on a Tree
- Sales‐delivery man problems on treelike networks
- Sometimes Travelling is Easy: The Master Tour Problem
- Two exact algorithms for the distance-constrained vehicle routing problem
- Vehicle scheduling on a tree with release and handling times
Cited in
(40)- Probabilistic time-dependent vehicle routing problem
- Vehicle routing with subtours
- An overview of graph covering and partitioning
- Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity
- Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems
- Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints
- The median routing problem for simultaneous planning of emergency response and non-emergency jobs
- Data mule scheduling on a path with handling time and time span constraints
- New LP relaxations for minimum cycle/path/tree cover problems
- An approximation algorithm for vehicle routing with compatibility constraints
- Distance constrained vehicle routing problem to minimize the total cost
- Better approximability results for min-max tree/cycle/path cover problems
- Approximation algorithms for distance constraint sweep coverage with base stations
- Approximation algorithms for generalized bounded tree cover
- Improved approximation algorithms for the min-max tree cover and bounded tree cover problems
- Approximation Algorithms for Conflict-Free Vehicle Routing
- The k-dissimilar vehicle routing problem
- Improved approximation algorithms for min-max and minimum vehicle routing problems
- Improved approximation algorithms for some min-max and minimum cycle cover problems
- The school bus problem on trees
- The capacitated orienteering problem
- Prize-collecting TSP with a budget constraint
- Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems
- Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
- Approximations for minimum and min-max vehicle routing problems
- New approximation algorithms for the rooted budgeted cycle cover problem
- Approximation algorithms for some minimum postmen cover problems
- New approximation algorithms for the minimum cycle cover problem
- New approximation algorithms for the rooted budgeted cycle cover problem
- Exact and approximation algorithms for the multi-depot data mule scheduling with handling time and time span constraints
- Review of the application of quantum annealing-related technologies in transportation optimization
- Approximation algorithms for the capacitated min-max and minimum graph cover problems
- Approximation algorithms for correlated knapsack orienteering
- Approximating graphic min-max and minimum cycle/path/tree cover problems
- Exact and approximation algorithms for the multi-depot data mule scheduling with handling time and time span constraints
- Constant-factor approximation to deadline TSP and related problems in (almost) quasi-polytime
- Euclidean capacitated vehicle routing in the random setting: a 1.55-approximation algorithm
- Approximation algorithms for the capacitated min-max and minimum graph cover problems
- Approximation algorithm for the min-max partial tree cover problem
- Set covering in fuel-considered vehicle routing problems
This page was built for publication: Approximation algorithms for distance constrained vehicle routing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2892157)
