MViewRouter: Internalizing Geometric Equivariance via Multi-view Alternating Attention for Combinatorial Routing 事件

MViewRouter: Internalizing Geometric Equivariance via Multi-view Alternating Attention for Combinatorial Routing arXiv:2606.01084v1 Announce Type: cross Abstract: 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-world applications. While recent deep reinforcement learning methods have shown promising performance, they typically handle geometric symmetries only through d