The authors define STSPTWPD, supply arc-based and node-based formulations with arc-reduction preprocessing, and benchmark them on Gurobi and D-Wave LeapCQMHybrid.
arXiv preprint arXiv:2504.01560 , year=
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Iterative cutting-plane generation and arc preprocessing reduce TSP model size and yield performance gains on classical, direct quantum, and hybrid D-Wave solvers.
citing papers explorer
-
Steiner Traveling Salesman Problem with Time Windows and Pickup-Delivery: integrating classical and quantum optimization
The authors define STSPTWPD, supply arc-based and node-based formulations with arc-reduction preprocessing, and benchmark them on Gurobi and D-Wave LeapCQMHybrid.
-
Cutting-plane methodology via quantum optimization for solving the Traveling Salesman Problem
Iterative cutting-plane generation and arc preprocessing reduce TSP model size and yield performance gains on classical, direct quantum, and hybrid D-Wave solvers.