42 citations · 55 across the 9 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.AI2023★ 2 cited
Pointerformer: Deep Reinforced Multi-Pointer Transformer for the Traveling Salesman Problem
Yan Jin, Yuandong Ding, Xuanhao Pan +5
Traveling Salesman Problem (TSP), as a classic routing optimization problem originally arising in the domain of transportation and logistics, has become a critical task in broader…
cs.AI2023★ 4 cited
H-TSP: Hierarchically Solving the Large-Scale Travelling Salesman Problem
Xuanhao Pan, Yan Jin, Yuandong Ding +4
We propose an end-to-end learning framework based on hierarchical reinforcement learning, called H-TSP, for addressing the large-scale Travelling Salesman Problem (TSP). The propos…
cs.DS2023★ 1 cited
Two New Upper Bounds for the Maximum k-plex Problem
Jiongzhi Zheng, Mingming Jin, Kun He
A k-plex in a graph is a vertex set where each vertex is non-adjacent to at most k vertices (including itself) in this set, and the Maximum k-plex Problem (MKP) is to find the larg…