The authors define STSPTWPD, supply arc-based and node-based formulations with arc-reduction preprocessing, and benchmark them on Gurobi and D-Wave LeapCQMHybrid.
Fleischmann, A cutting plane procedure for the travelling salesman problem on road networks, European Journal of Operational Research 21 (1985) 307–317
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.ET 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
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.