Learning to Sparsify Travelling Salesman Problem Instances

Learning to Sparsify Travelling Salesman Problem Instances

Integration of AI and OR Techniques in Constraint Programming (CPAIOR), 2021

19 April 2021

James Fitzpatrick

ArXiv (abs)PDF HTML

Papers citing "Learning to Sparsify Travelling Salesman Problem Instances"

7 / 7 papers shown

Title
COMBHelper: A Neural Approach to Reduce Search Space for Graph Combinatorial ProblemsAAAI Conference on Artificial Intelligence (AAAI), 2023 Hao Tian Sourav Medya Wei Ye 282 5 0 14 Dec 2023
Revisit the Algorithm Selection Problem for TSP with Spatial Information Enhanced Graph Neural NetworksInternational Conference on Agents and Artificial Intelligence (ICAART), 2023 Yaobo Song Laurens Bliek Yingqian Zhang 155 2 0 08 Feb 2023
The (Un)Scalability of Heuristic Approximators for NP-Hard Search Problems Sumedh Pendurkar Taoan Huang Sven Koenig Guni Sharon 207 1 0 07 Sep 2022
Learning to Prune Instances of Steiner Tree Problem in GraphsInternational Network Optimization Conference (INOC), 2022 Jiwei Zhang Deepak Ajwani 115 2 0 25 Aug 2022
A New Constructive Heuristic driven by Machine Learning for the Traveling Salesman Problem U. Mele L. Gambardella R. Montemanni 66 16 0 17 Aug 2021
Machine Learning Constructives and Local Searches for the Travelling Salesman Problem Tommaso Vitali U. Mele L. Gambardella R. Montemanni 80 4 0 02 Aug 2021
Learning fine-grained search space pruning and heuristics for combinatorial optimizationJournal of Heuristics (JH), 2020 Juho Lauri Sourav Dutta Marco Grassia Deepak Ajwani 166 22 0 05 Jan 2020