arXiv AI
GeoPAR: Large-Scale Multi-Agent Combinatorial Optimization with Geometry-Guided Parallel Autoregressive Learning
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
arXiv AI
Jun 2
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.
arXiv AI
Jun 3
ASAP: Exploiting the Satisficing Generalization Edge in Neural Combinatorial Optimization
arXiv:2501. 17377v4 Announce Type: replace-cross Abstract: Deep Reinforcement Learning (DRL) has emerged as a promising approach for solving Combinatorial Optimization (CO) problems, such as the 3D Bin Packing Problem (3D-BPP), Traveling Salesman Problem (TSP), or Vehicle Routing Problem (VRP), but these neural solvers often exhibit brittleness when facing distribution shifts.
arXiv Machine Learning
Aug 12
URS: A Unified Neural Routing Solver for Cross-Problem Zero-Shot Generalization
arXiv:2509. 23413v3 Announce Type: replace Abstract: Multi-task neural routing solvers have emerged as a promising paradigm for their ability to solve multiple vehicle routing problems (VRPs) using a single model.
arXiv AI
Aug 18
ClawGym II: Exploring Black-Box RL on Agent Harness
arXiv:2608. 16798v1 Announce Type: cross Abstract: Agent harnesses have substantially improved performance on long-horizon tasks by coordinating agent interactions with the environment.
arXiv Machine Learning
Aug 26
Improving Cross-Problem Vehicle Routing with Locally Augmented Preferences and Representation Disentanglement
arXiv:2608.24859v1 Announce Type: new Abstract: Multi-task vehicle routing problem (VRP) solvers seek to handle multiple VRP variants within a single unified model, avoiding the need to train a separ...
arXiv Machine Learning
Jun 10
Geometry-Aware Reinforcement Learning for 2D Irregular Nesting
arXiv:2606. 10611v1 Announce Type: new Abstract: Traditional heuristic solvers for the 2D irregular nesting problem share a fundamental limitation: they are blind to polygon geometry, relying on guided brute-force to navigate the continuous placement space with minimal geometrical guidance.