Exact and approximation algorithms for routing a convoy through a graph

From MaRDI portal
(Redirected from Exact and approximation algorithms for routing a convoy through a graph)
Exact and approximation algorithms for routing a convoy through a graph (scientific article; zbMATH DE number 7953335)

DOI10.4230/LIPICS.MFCS.2023.86MaRDI QIDQ6647729zbMATH OpenFDO

Authors Martijn van Ee, Tim Oosterwijk, René A. Sitters, Andreas Wiese

Publication date 3 December 2024

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2023.86


zbMATH Keywords

approximation algorithmsconvoy routingshortest path problemtraveling salesperson problem

Mathematics Subject Classification ID

Theory of computing (68Qxx)








Cited in
(1)








This page was built for publication: Exact and approximation algorithms for routing a convoy through a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6647729)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Exact_and_approximation_algorithms_for_routing_a_convoy_through_a_graph_(scientific_article;_zbMATH_DE_number_7953335)&oldid=96056678"
Powered by MediaWiki