Makespan trade-offs for visiting triangle edges (extended abstract)

DOI10.1007/978-3-030-79987-8_24OpenAlexW3174121708MaRDI QIDQ2115869

Somnath Kundu, Paweł Prałat, Konstantinos Georgiou

Publication date: 22 March 2022

Full work available at URL: https://arxiv.org/abs/2105.01191

zbMATH Keywords

trianglevehicle routingtrade-offs2-dimensional search and navigationmake-span

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Uses Software

• VRP

Cites Work

• A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
• The vehicle routing problem: An overview of exact and approximate algorithms
• Parallel searching in the plane
• Structural information and communication complexity. 27th international colloquium, SIROCCO 2020, Paderborn, Germany, June 29 -- July 1, 2020. Proceedings
• The Truck Dispatching Problem
• The Vehicle Routing Problem
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• The Traveling Salesman Problem for Lines, Balls, and Planes

This page was built for publication: Makespan trade-offs for visiting triangle edges (extended abstract)