A Quasi-polynomial Time Approximation Scheme for Euclidean CVRPTW

DOI10.1007/978-3-319-12691-3_6zbMath1431.90025OpenAlexW420771443MaRDI 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

zbMATH Keywords

approximation algorithmmodern logisticsCVRPTW

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation algorithms (68W25)

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

This page was built for publication: A Quasi-polynomial Time Approximation Scheme for Euclidean CVRPTW