Neuro-Ising: Accelerating Large-Scale Traveling Salesman Problems via Graph Neural Network Guided Localized Ising Solvers

One of the most extensively studied combinatorial optimization problems is the Travelling Salesman Problem (TSP). Considerable research efforts in the past have resulted in exact solvers. However, the runtime of such hand-crafted solutions increases exponentially with problem size. Ising model based...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on computer-aided design of integrated circuits and systems Jg. 41; H. 12; S. 5408 - 5420
Hauptverfasser:	Sanyal, Sourav, Roy, Kaushik
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.12.2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Artificial intelligence Clustering Combinatorial analysis Combinatorial mathematics combinatorial optimization Convergence Graph neural networks Ising model ising optimization Machine learning Neural networks NP-hard problem NP-hard problems Optimization Solvers Tabu search Traveling salesman problem Traveling salesman problems travelling salesman problem
ISSN:	0278-0070, 1937-4151
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!