QAOA solves simplified, cost-weighted tail-assignment instances with up to 14 routes in simulation, but its time-to-solution grows faster than classical branch-and-price.
Gr¨ onkvist,The Tail Assignment Problem, Phd thesis, Chalmers University of Technology and G¨ oteborg Uni- versity (2005)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
quant-ph 1years
2024 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Optimization of Flight Routes: Quantum Approximate Optimization Algorithm for the Tail Assignment Problem
QAOA solves simplified, cost-weighted tail-assignment instances with up to 14 routes in simulation, but its time-to-solution grows faster than classical branch-and-price.