The travelling salesman problem and adiabatic quantum computation: an algorithm
Crossref DOI link: https://doi.org/10.1007/s11128-019-2206-9
Published Online: 2019-02-10
Published Print: 2019-03
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Kieu, Tien D. http://orcid.org/0000-0002-1551-6128
Text and Data Mining valid from 2019-02-10
Article History
Received: 14 August 2018
Accepted: 1 February 2019
First Online: 10 February 2019