1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.AI2026
Construct, Merge, Solve & Adapt with Reinforcement Learning for the min-max Multiple Traveling Salesman Problem
Guillem Rodríguez-Corominas, Maria J. Blesa, Christian Blum
The Multiple Traveling Salesman Problem (mTSP) extends the Traveling Salesman Problem to m tours that start and end at a common depot and jointly visit all customers exactly once.…
cs.LG2024★ 1 cited
Accelerating the k-means++ Algorithm by Using Geometric Information
Guillem Rodríguez Corominas, Maria J. Blesa, Christian Blum
In this paper, we propose an acceleration of the exact k-means++ algorithm using geometric information, specifically the Triangle Inequality and additional norm filters, along with…