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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Proceedings of the Steklov Institute of Mathematics Ročník 319; číslo Suppl 1; s. S140 - S155
Hlavní autoři:	Khachay, M. Yu, Neznakhina, E. D., Ryzhenko, K. V.
Médium:	Journal Article Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	Moscow Pleiades Publishing 01.12.2022 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!