A Quasi-polynomial Time Approximation Scheme for Euclidean CVRPTW
From MaRDI portal
Publication:2942382
DOI10.1007/978-3-319-12691-3_6zbMath1431.90025MaRDI QIDQ2942382
Liang Song, Hejiao Huang, Hongwei David Du
Publication date: 11 September 2015
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-12691-3_6
90C35: Programming involving graphs or networks
90B06: Transportation, logistics and supply chain management
68W25: Approximation algorithms
Cites Work
- Unnamed Item
- Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle
- Competitive memetic algorithms for arc routing problems
- Approximation schemes for NP-hard geometric optimization problems: a survey
- An approximability result of the multi-vehicle scheduling problem on a path with release and handling times
- Approximating a vehicle scheduling problem with time windows and handling times
- The Truck Dispatching Problem
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Bounds and Heuristics for Capacitated Routing Problems
- An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem
