Graph convolutional neural networks for the travelling salesman problem
Combinatorial optimization problems, also called NP-hard problems, are practical constraint satisfaction problems that are impossible to solve optimally at large scales. In practice, handcrafted heuristic algorithms are able to solve problems with up to a million variables and constraints. These alg...
Saved in:
主要作者: | Joshi, Chaitanya Krishna |
---|---|
其他作者: | Xavier Bresson |
格式: | Final Year Project |
語言: | English |
出版: |
2019
|
主題: | |
在線閱讀: | http://hdl.handle.net/10356/77027 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |
相似書籍
-
Efficient graph neural networks for travelling salesman problem using multilevel clustering
由: Dwivedee, Lakshyajeet
出版: (2021) -
Graph convolutional neural networks for text categorization
由: Lakhotia, Suyash
出版: (2018) -
Natural language translation with graph convolutional neural network
由: Zhu, Yimin
出版: (2018) -
Semi supervised learning with graph convolutional networks
由: Ong, Jia Rui
出版: (2019) -
Class-based attack on graph convolution network
由: He, HeFei
出版: (2022)