Cover Image

On Size and Hardness Generalization in Unsupervised Learning for the Travelling Salesman Problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Min, Yimeng, Gomes, Carla P.
Format:	Preprint
Published:	2024
Subjects:	Artificial Intelligence Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Unsupervised Learning for Solving the Travelling Salesman Problem
by: Min, Yimeng, et al.
Published: (2023)

Unsupervised Learning for Quadratic Assignment
by: Min, Yimeng, et al.
Published: (2025)

Structure As Search: Unsupervised Permutation Learning for Combinatorial Optimization
by: Min, Yimeng, et al.
Published: (2025)

Comment on paper: Position: Rethinking Post-Hoc Search-Based Neural Approaches for Solving Large-Scale Traveling Salesman Problems
by: Min, Yimeng
Published: (2024)

Learning Unbiased Permutations via Flow Matching
by: Min, Yimeng, et al.
Published: (2026)

Looking Ahead to Avoid Being Late: Solving Hard-Constrained Traveling Salesman Problem
by: Chen, Jingxiao, et al.
Published: (2024)

Generative Modeling for Robust Deep Reinforcement Learning on the Traveling Salesman Problem
by: Li, Michael, et al.
Published: (2025)

Distilling Privileged Information for Dubins Traveling Salesman Problems with Neighborhoods
by: Shin, Min Kyu, et al.
Published: (2024)

Divergence-Suppressing Couplings for Rectified Flow
by: Min, Yimeng, et al.
Published: (2026)

Diversity Optimization for Travelling Salesman Problem via Deep Reinforcement Learning
by: Li, Qi, et al.
Published: (2025)

Combining Reinforcement Learning and Optimal Transport for the Traveling Salesman Problem
by: Goh, Yong Liang, et al.
Published: (2022)

A Unified Deep Reinforcement Learning Approach for Close Enough Traveling Salesman Problem
by: Fan, Mingfeng, et al.
Published: (2025)

An End-to-End Deep Reinforcement Learning Approach for Solving the Traveling Salesman Problem with Drones
by: Zeng, Taihelong, et al.
Published: (2025)

Adaptation and Fine-tuning with TabPFN for Travelling Salesman Problem
by: Vu, Nguyen Gia Hien, et al.
Published: (2025)

Construct, Merge, Solve & Adapt with Reinforcement Learning for the min-max Multiple Traveling Salesman Problem
by: Rodríguez-Corominas, Guillem, et al.
Published: (2026)

iMTSP: Solving Min-Max Multiple Traveling Salesman Problem with Imperative Learning
by: Guo, Yifan, et al.
Published: (2024)

Permutation Picture of Graph Combinatorial Optimization Problems
by: Min, Yimeng
Published: (2024)

Position: Rethinking Post-Hoc Search-Based Neural Approaches for Solving Large-Scale Traveling Salesman Problems
by: Xia, Yifan, et al.
Published: (2024)

Unsupervised Ordering for Maximum Clique
by: Min, Yimeng, et al.
Published: (2025)

HardCore Generation: Generating Hard UNSAT Problems for Data Augmentation
by: Cotnareanu, Joseph, et al.
Published: (2024)

Graph Neural Networks are Heuristics
by: Min, Yimeng, et al.
Published: (2026)

Spatial-Aware Deep Reinforcement Learning for the Traveling Officer Problem
by: Strauß, Niklas, et al.
Published: (2024)

Deep Reinforcement Learning for Traveling Purchaser Problems
by: Yuan, Haofeng, et al.
Published: (2024)

Test-Time Augmentation for Traveling Salesperson Problem
by: Ishiyama, Ryo, et al.
Published: (2024)

HardNet: Hard-Constrained Neural Networks with Universal Approximation Guarantees
by: Min, Youngjae, et al.
Published: (2024)

A First Guess is Rarely the Final Answer: Learning to Search in the Traveling Salesperson Problem
by: Garmendia, Andoni Irazusta
Published: (2026)

An Unsupervised Learning Framework Combined with Heuristics for the Maximum Minimal Cut Problem
by: Liu, Huaiyuan, et al.
Published: (2024)

Verifier-Backed Hard Problem Generation for Mathematical Reasoning
by: Lai, Yuhang, et al.
Published: (2026)

Angel or Devil: Discriminating Hard Samples and Anomaly Contaminations for Unsupervised Time Series Anomaly Detection
by: Zhang, Ruyi, et al.
Published: (2024)

Reinforcement Learning-based Non-Autoregressive Solver for Traveling Salesman Problems
by: Xiao, Yubin, et al.
Published: (2023)

Bandit based Dynamic Candidate Edge Selection in Solving Traveling Salesman Problems
by: Wang, Long, et al.
Published: (2025)

HardSATGEN: Understanding the Difficulty of Hard SAT Formula Generation and A Strong Structure-Hardness-Aware Baseline
by: Li, Yang, et al.
Published: (2023)

Generative Pre-Training of Time-Series Data for Unsupervised Fault Detection in Semiconductor Manufacturing
by: Lee, Sewoong, et al.
Published: (2023)

Multimodal Fused Learning for Solving the Generalized Traveling Salesman Problem in Robotic Task Planning
by: Cheng, Jiaqi, et al.
Published: (2025)

POPE: Learning to Reason on Hard Problems via Privileged On-Policy Exploration
by: Qu, Yuxiao, et al.
Published: (2026)

More Consistent Accuracy PINN via Alternating Easy-Hard Training
by: Gao, Zhaoqian, et al.
Published: (2025)

Health Index Estimation Through Integration of General Knowledge with Unsupervised Learning
by: Bajarunas, Kristupas, et al.
Published: (2024)

Freeze and Conquer: Reusable Ansatz for Solving the Traveling Salesman Problem
by: Fagiolo, Fabrizio, et al.
Published: (2025)

Machine Learning for Two-Stage Graph Sparsification for the Travelling Salesman Problem
by: Lin, Bo-Cheng, et al.
Published: (2026)

Steiner Traveling Salesman Problem with Quantum Annealing
by: Ciacco, Alessia, et al.
Published: (2025)