most citedAn Efficient Diffusion-based Non-Autoregressive Solver for Traveling Salesman Problem

1 citations · 1 across the 4 of their papers we have counts for

collaborators

5 papers

cs.CV2025

iPEAR: Iterative Pyramid Estimation with Attention and Residuals for Deformable Medical Image Registration

Heming Wu, Di Wang, Tai Ma +6

Existing pyramid registration networks may accumulate anatomical misalignments and lack an effective mechanism to dynamically determine the number of optimization iterations under…

cs.LG2025

Towards Efficient Few-shot Graph Neural Architecture Search via Partitioning Gradient Contribution

Wenhao Song, Xuan Wu, Bo Yang +6

To address the weight coupling problem, certain studies introduced few-shot Neural Architecture Search (NAS) methods, which partition the supernet into multiple sub-supernets. Howe…

cs.NE2025

Efficient Heuristics Generation for Solving Combinatorial Optimization Problems Using Large Language Models

Xuan Wu, Di Wang, Chunguo Wu +4

Recent studies exploited Large Language Models (LLMs) to autonomously generate heuristics for solving Combinatorial Optimization Problems (COPs), by prompting LLMs to first provide…

cs.AI2025

GELD: A Unified Neural Model for Efficiently Solving Traveling Salesman Problems Across Different Scales

Yubin Xiao, Di Wang, Rui Cao +3

The Traveling Salesman Problem (TSP) is a well-known combinatorial optimization problem with broad real-world applications. Recent advancements in neural network-based TSP solvers…

cs.LG20251 cited

An Efficient Diffusion-based Non-Autoregressive Solver for Traveling Salesman Problem

Mingzhao Wang, You Zhou, Zhiguang Cao +7

Recent advances in neural models have shown considerable promise in solving Traveling Salesman Problems (TSPs) without relying on much hand-crafted engineering. However, while non-…