Constant-Factor Approximation Algorithms for a Series of Combinatorial Routing Problems Based on the Reduction to the Asymmetric Traveling Salesman Problem

For the first time, algorithms with constant performance guarantees are substantiated for a series of asymmetric routing problems of combinatorial optimization: the Steiner cycle problem (SCP), the generalized traveling salesman problem (GTSP), the capacitated vehicle routing problem with unsplittab...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Proceedings of the Steklov Institute of Mathematics Jg. 319; H. Suppl 1; S. S140 - S155
Hauptverfasser:	Khachay, M. Yu, Neznakhina, E. D., Ryzhenko, K. V.
Format:	Journal Article Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	Moscow Pleiades Publishing 01.12.2022 Springer Nature B.V
Schlagworte:	Algorithms Approximation Asymmetry Combinatorial analysis Mathematical analysis Mathematics Mathematics and Statistics Optimization Polynomials Route planning Traveling salesman problem Vehicle routing prize collecting traveling salesman problem polynomial-time reduction asymmetric traveling salesman problem generalized traveling salesman problem vehicle routing problem constant-factor approximation algorithm Steiner cycle problem
ISSN:	0081-5438, 1531-8605
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!