Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters

We consider the geometric version of the well-known Generalized Traveling Salesman Problem introduced in 2015 by Bhattacharya et al. that is called the Euclidean Generalized Traveling Salesman Problem in Grid Clusters (EGTSP-GC). They proved the intractability of the problem and proposed first polyn...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Annals of mathematics and artificial intelligence Ročník 88; číslo 1-3; s. 53 - 69
Hlavní autori:	Khachay, Michael, Neznakhina, Katherine
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Cham Springer International Publishing 01.03.2020 Springer Springer Nature B.V
Predmet:	Algorithms Approximation Artificial Intelligence Clusters Complex Systems Computer Science Euclidean geometry Management science Mathematical analysis Mathematics Polynomials Traveling salesman problem Generalized traveling salesman problem Polynomial time approximation scheme 90C27 Polynomial time solvable subclass
ISSN:	1012-2443, 1573-7470
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!