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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Annals of mathematics and artificial intelligence Jg. 88; H. 1-3; S. 53 - 69
Hauptverfasser:	Khachay, Michael, Neznakhina, Katherine
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Cham Springer International Publishing 01.03.2020 Springer Springer Nature B.V
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!