Formulating and Solving Routing Problems on Quantum Computers

Formulating and Solving Routing Problems on Quantum Computers

The determination of vehicle routes fulfilling connectivity, time, and operational constraints is a well-studied combinatorial optimization problem. The NP-hard complexity of vehicle routing problems has fostered the adoption of tailored exact approaches, matheuristics, and metaheuristics on classic...

Full description

Bibliographic Details
Main Authors: Stuart Harwood, Claudio Gambella, Dimitar Trenev, Andrea Simonetto, David Bernal Neira, Donny Greenberg
Format: Article
Language:English
Published: IEEE 2021-01-01
Series:IEEE Transactions on Quantum Engineering
Subjects:
Optimization
quantum computing
routing
variational algorithms
Online Access:https://ieeexplore.ieee.org/document/9314905/

Internet

https://ieeexplore.ieee.org/document/9314905/

Similar Items