Crossmark

New heuristic algorithms for the Dubins traveling salesman problem

Crossref DOI link: https://doi.org/10.1007/s10732-020-09440-2

Published Online: 2020-02-13

Published Print: 2020-08

Update policy: https://doi.org/10.1007/springer_crossmark_policy

Authors

Babel, Luitpold https://orcid.org/0000-0001-5436-1299
Funding

Funding for this research was provided by:

Universität der Bundeswehr München
License Information

Text and Data Mining valid from 2020-02-13

Version of Record valid from 2020-02-13
More Information

Article History

Received: 3 November 2018

Revised: 23 July 2019

Accepted: 8 February 2020

First Online: 13 February 2020