Graph convolutional neural networks for the travelling salesman problem

• Main Author: Joshi, Chaitanya Krishna
• Other Authors: Xavier Bresson
• Format: Final Year Project
• Language: English
• Published: 2019
• Subjects: DRNTU::Engineering::Computer science and engineering::Computing methodologies::Artificial intelligence
• Online Access: http://hdl.handle.net/10356/77027
• Institution: Nanyang Technological University

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...