# Assignment-Routing Optimization with Cutting-Plane Subtour Elimination: Solver and Benchmark Dataset

arXiv: https://arxiv.org/abs/2510.17888 · HTML: https://mlsanity.com/paper/2510.17888/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 18 Oct 2025.

## Built on by (most cited first, 1 of 1)

- [Assignment-Routing Optimization: Solvers for Problems Under Constraints](https://mlsanity.com/paper/2512.18618/) (2025)

## Abstract (arXiv)

We study a joint routing-assignment optimization problem in which a set of items must be paired one-to-one with a set of placeholders while simultaneously determining a Hamiltonian cycle that visits every node exactly once. Both the assignment and routing decisions are optimized jointly to minimize the total travel cost. In this work, we propose a method to solve this problem using an exact MIP formulation with Gurobi, including cutting-plane subtour elimination. With analysis of the computational complexity and through extensive experiments, we analyze the computational limitations of this approach as the problem size grows and reveal the challenges associated with the need for more efficient algorithms for larger instances. The dataset, formulations, and experimental results provided here can serve as benchmarks for future studies in this research area. GitHub repository: https://github.com/QL-YUAN/Joint-Assignment-Routing-Optimization