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 algorithmsconvoy routingshortest path problemtraveling salesperson problem

Mathematics Subject Classification ID

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

Cites work

• A (slightly) improved approximation algorithm for metric TSP
• A comprehensive survey on the quickest path problem
• A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem
• An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem
• Exact and approximation algorithms for routing a convoy through a graph
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1775400 (Why is no real title available?)
• Matching, Euler tours and the Chinese postman
• On the complexity of edge traversing
• Solving a Time-Space Network Formulation for the Convoy Movement Problem
• The Traveling-Salesman Problem and Minimum Spanning Trees

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)