arxiv
PublishedOctober 21, 2026 at 4:00 AM
EDISCO: Equivariant DIScrete Diffusion for Euclidean Combinatorial Optimization
Publisher summary· verbatim
arXiv:2610.04953v2 Announce Type: replace-cross Abstract: Euclidean combinatorial optimization problems (ECOPs), such as the Traveling Salesman Problem (TSP) and Capacitated Vehicle Routing Problem (CVRP), possess inherent symmetries under the two-dimensional Euclidean group E(2), including rotation
Stay posted· Newsletter
Three short emails a week: Monday, Wednesday and Friday. Top movers, new models and the most-referenced story.
Your email is used only to send The Bubble Brief. Privacy policy
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivAn AI Security Agent for University ACMIS: Multi-Vector Threat Detection and Automated Response7harxivLearning Transferable Latent User Preferences for Human-Aligned Decision Making7harxivRepair the Core, Not the Symptom: Planning-Graph Repair for Long-Horizon Agents7harxivIndustryForge-27B: A Domain-Enhanced Multimodal Foundation Model for Industrial CAD7hThe Bubble Brief
MON · WED · FRIRead AI insights every Monday, Wednesday and Friday — top movers, new models, story of the week.
Your email is used only to send The Bubble Brief. Privacy policy
Originally published on arxiv ↗