The paper proposes the Steiner TSP with Time Windows and Pickup-Delivery, with two formulations, a preprocessing reduction, and benchmark tests on classical and quantum-hybrid solvers.
Title resolution pending
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 paper proposes the Steiner TSP with Time Windows and Pickup-Delivery, with two formulations, a preprocessing reduction, and benchmark tests on classical and quantum-hybrid solvers.
-
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.