5 papers
MViewRouter: Internalizing Geometric Equivariance via Multi-view Alternating Attention for Combinatorial Routing
Shiyan Liu, Bohan Tan, Yaoxin Wu +1
Combinatorial routing problems such as the Traveling Salesman Problem (TSP) and the Capacitated Vehicle Routing Problem (CVRP) are fundamental NP-hard problems with broad real-worl…
Aligning LLMs with Graph Neural Solvers for Combinatorial Optimization
Shaodi Feng, Zhuoyi Lin, Yaoxin Wu +4
Recent research has demonstrated the effectiveness of large language models (LLMs) in solving combinatorial optimization problems (COPs) by representing tasks and instances in natu…
VAGPO: Vision-augmented Asymmetric Group Preference Optimization for Graph Routing Problems
Shiyan Liu, Bohan Tan, Zhiguang Cao +1
Graph routing problems play a vital role in web-related networks, where finding optimal paths across graphs is essential for efficient data transmission and content delivery. Class…
FluentLip: A Phonemes-Based Two-stage Approach for Audio-Driven Lip Synthesis with Optical Flow Consistency
Shiyan Liu, Rui Qu, Yan Jin
Generating consecutive images of lip movements that align with a given speech in audio-driven lip synthesis is a challenging task. While previous studies have made strides in synch…
DualOpt: A Dual Divide-and-Optimize Algorithm for the Large-scale Traveling Salesman Problem
Shipei Zhou, Yuandong Ding, Chi Zhang +2
This paper proposes a dual divide-and-optimize algorithm (DualOpt) for solving the large-scale traveling salesman problem (TSP). DualOpt combines two complementary strategies to im…