On Euclidean vehicle routing with allocation

DOI10.1016/j.comgeo.2008.12.009zbMath1209.90097OpenAlexW2031071271MaRDI QIDQ2269139

Reto Spöhel, Jan Remy, Andreas Weißl

Publication date: 16 March 2010

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2008.12.009

zbMATH Keywords

facility locationapproximation algorithmsEuclidean TSPgeometric problems

Mathematics Subject Classification ID

Traffic problems in operations research (90B20)

Related Items

An optimization-driven dynamic vehicle routing algorithm for on-demand meal delivery using drones

Cites Work

• On range searching with semialgebraic sets
• The vehicle routing-allocation problem: A unifying framework
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• A tabu search algorithm for the single vehicle routing allocation problem
• On Euclidean Vehicle Routing with Allocation
• Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item