Approximation algorithms for distance constrained vehicle routing problems
From MaRDI portal
Publication:2892157
DOI10.1002/net.20435zbMath1242.90031OpenAlexW2068840184MaRDI QIDQ2892157
Publication date: 18 June 2012
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20435
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation algorithms (68W25)
Related Items (25)
An overview of graph covering and partitioning ⋮ Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity ⋮ Improved approximation algorithms for some min-max and minimum cycle cover problems ⋮ Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems ⋮ 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 school bus problem on trees ⋮ The median routing problem for simultaneous planning of emergency response and non-emergency jobs ⋮ Better approximability results for min-max tree/cycle/path cover problems ⋮ Set covering in fuel-considered vehicle routing problems ⋮ Approximation algorithms for distance constraint sweep coverage with base stations ⋮ Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems ⋮ Data mule scheduling on a path with handling time and time span constraints ⋮ The capacitated orienteering problem ⋮ Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems ⋮ New approximation algorithms for the minimum cycle cover problem ⋮ Vehicle routing with subtours ⋮ Probabilistic time-dependent vehicle routing problem ⋮ New LP relaxations for minimum cycle/path/tree cover problems ⋮ Approximation Algorithms for Generalized Bounded Tree Cover ⋮ New approximation algorithms for the rooted budgeted cycle cover problem ⋮ Approximation algorithms for some minimum postmen cover problems ⋮ New approximation algorithms for the rooted budgeted cycle cover problem ⋮ Improved Approximation Algorithms for the Min-Max Tree Cover and Bounded Tree Cover Problems ⋮ Prize-Collecting TSP with a Budget Constraint
Cites Work
- Unnamed Item
- Bin packing can be solved within 1+epsilon in linear time
- Vehicle scheduling on a tree with release and handling times
- Approximation algorithms for some vehicle routing problems
- Approximating the \(k\)-traveling repairman problem with repair times
- Two exact algorithms for the distance-constrained vehicle routing problem
- Minimum Vehicle Routing with a Common Deadline
- Capacitated Vehicle Routing on Trees
- On the Distance Constrained Vehicle Routing Problem
- Preemptive Ensemble Motion Planning on a Tree
- Sometimes Travelling is Easy: The Master Tour Problem
- Sales‐delivery man problems on treelike networks
- Approximation Algorithms for Orienteering and Discounted-Reward TSP
- Approximations for minimum and min-max vehicle routing problems
- A new approximation algorithm for the capacitated vehicle routing problem on a tree
This page was built for publication: Approximation algorithms for distance constrained vehicle routing problems
