Efficient graph neural networks for travelling salesman problem using multilevel clustering
The goal of the Travelling Salesman Problem is to find the shortest route that visits each city exactly once and returns to the origin, given a list of cities and the distances between each pair of cities. Such combinatorial optimization problems are difficult to solve efficiently given large proble...
Saved in:
主要作者: | Dwivedee, Lakshyajeet |
---|---|
其他作者: | Xavier Bresson |
格式: | Final Year Project |
語言: | English |
出版: |
Nanyang Technological University
2021
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/148040 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
Graph convolutional neural networks for the travelling salesman problem
由: Joshi, Chaitanya Krishna
出版: (2019) -
Federated graph neural network
由: Koh, Tat You @ Arthur
出版: (2021) -
Benchmarking novel graph neural networks
由: Bhagwat, Abhishek
出版: (2021) -
Federated learning for graph neural networks
由: Yan, Yige
出版: (2023) -
An investigation of the application of graph neural networks in recommendation systems
由: Koh, Jaylene Jia Ying
出版: (2023)