Exact and approximation algorithms for routing a convoy through a graph

DOI10.1007/S10107-024-02159-ZMaRDI QIDQ6932174zbMATH OpenFDO

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

Publication date 9 September 2025

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://research.vu.nl/en/publications/cae572ff-f830-4025-82ed-460f67cd18e9

zbMATH Keywords

approximation algorithmsshortest path problemconvoy routingtraveling salesperson problem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Approximation algorithms (68W25)

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 Q6932174)