Makespan trade-offs for visiting triangle edges (extended abstract)
From MaRDI portal
(Redirected from Publication:2115869)
Recommendations
Cites work
- A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
- Parallel searching in the plane
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Structural information and communication complexity. 27th international colloquium, SIROCCO 2020, Paderborn, Germany, June 29 -- July 1, 2020. Proceedings
- The traveling salesman problem for lines, balls, and planes
- The truck dispatching problem
- The vehicle routing problem
- The vehicle routing problem: An overview of exact and approximate algorithms
This page was built for publication: Makespan trade-offs for visiting triangle edges (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115869)