Analysis of a High-Performance TSP Solver on the GPU

Graphical Processing Units have been applied to solve NP-hard problems with no known polynomial time solutions. An example of such a problem is the Traveling Salesman Problem (TSP). The TSP is one of the most commonly studied combinatorial optimization problems and has multiple applications in the a...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	The ACM journal of experimental algorithmics 2018-11, Vol.23, p.1-22
Hauptverfasser:	Robinson, Jeffrey A., Vrbsky, Susan V., Hong, Xiaoyan, Eddy, Brian P.
Format:	Artikel
Sprache:	eng
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!