Chaitanya K. Joshi
Chaitanya K. Joshi
Home
Publications
Projects
Blog
Talks
CV
Light
Dark
Automatic
Travelling Salesman Problem
Learning TSP Requires Rethinking Generalization
We study zero-shot generalization to large-scale instances in neural network-driven solvers for the Travelling Salesman Problem: what architectures, inductive biases and learning paradigms enable better generalization?
(Invited submission to the Constraints Journal)
Chaitanya K. Joshi
,
Quentin Cappart
,
Louis-Martin Rousseau
,
Thomas Laurent
PDF
Cite
Code
Project
Slides
Video
DOI
Blog
On Learning Paradigms for the Travelling Salesman Problem
How do learning paradigms impact zero-shot generalization to large-scale instances in learning-driven TSP solvers?
Chaitanya K. Joshi
,
Thomas Laurent
,
Xavier Bresson
PDF
Cite
Code
Project
Poster
An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem
Deep Graph ConvNets paired with parallelized graph search can learn TSP up to few hundred cities, but fall short of classical solvers.
Chaitanya K. Joshi
,
Thomas Laurent
,
Xavier Bresson
PDF
Cite
Code
Project
Project
Slides
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 …
Chaitanya K. Joshi
PDF
Cite
Code
Project
Poster
Slides
Video
DOI
Cite
×