A CQM-based quantum annealing formulation solves small shipment rerouting instances with the same optimal cost as an exact MIP solver, but the speed comparison rests on very small, non-binding test cases.
Quantum speedup of branch-and-bound algorithms
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Quantum Annealing Approaches to Solving the Shipment Rerouting Problems
A CQM-based quantum annealing formulation solves small shipment rerouting instances with the same optimal cost as an exact MIP solver, but the speed comparison rests on very small, non-binding test cases.