Iterative cutting-plane generation and arc preprocessing reduce TSP model size and yield performance gains on classical, direct quantum, and hybrid D-Wave solvers.
50 Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art , pages=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
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.