A bidirectional graph neural network for traveling salesman problems on arbitrary symmetric graphs.
Yujiao HuZhen ZhangYuan YaoXingpeng HuyanXingshe ZhouWee Sun LeePublished in: Eng. Appl. Artif. Intell. (2021)
Keyphrases
- hamiltonian cycle
- satisfy the triangle inequality
- edge weights
- traveling salesman problem
- neural network
- weighted graph
- directed graph
- bipartite graph
- graph structure
- labeled graphs
- graph representation
- graph construction
- spanning tree
- adjacency matrix
- graph coloring
- graph theoretic
- graph structures
- graph clustering
- graph theory
- graph mining
- phase transition
- undirected graph
- shortest path
- graph model
- ant colony optimization
- graph matching
- graph data
- combinatorial optimization
- dynamic graph
- random graphs
- graph search
- optimization problems
- graph databases
- triangle inequality
- relational structures
- combinatorial problems
- directed acyclic graph
- random walk
- combinatorial optimization problems
- connected components
- distribution network
- back propagation
- graph kernels
- data points
- search algorithm