An approximation algorithm for the clustered path travelling salesman problem
Crossref DOI link: https://doi.org/10.1007/s10878-023-01029-2
Published Online: 2023-04-30
Published Print: 2023-05
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Zhang, Jiaxuan
Gao, Suogang
Hou, Bo
Liu, Wen http://orcid.org/0000-0002-6872-3315
Funding for this research was provided by:
National Natural Science Foundation of China (11971146)
Text and Data Mining valid from 2023-04-30
Version of Record valid from 2023-04-30
Article History
Accepted: 3 April 2023
First Online: 30 April 2023
Declarations
:
: The authors have not disclosed any competing interests.