Exact and approximation algorithms for routing a convoy through a graph Exact and approximation algorithms for routing a convoy through a graph

We study routing problems of a convoy in a graph, generalizing the shortest path problem (SPP), the travelling salesperson problem (TSP), and the Chinese postman problem (CPP) which are all well-studied in the classical (non-convoy) setting. We assume that each edge in the graph has a length and a s...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Mathematical programming Ročník 213; číslo 1-2; s. 985 - 1008
Hlavní autori:	van Ee, Martijn, Oosterwijk, Tim, Sitters, René, Wiese, Andreas
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2025 Springer Nature B.V
Predmet:	Algorithms Approximation Automobiles Calculus of Variations and Optimal Control; Optimization Combinatorics Full Length Paper Graph theory Mathematical and Computational Physics Mathematical Methods in Physics Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Pareto optimum Polynomials Shortest-path problems Theoretical Traveling salesman problem Vehicles Shortest path problem 68Q25 90C39 Approximation algorithms 68W25 90C27 Convoy routing Traveling salesperson problem
ISSN:	0025-5610, 1436-4646
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!