Parameterized algorithms and complexity for the traveling purchaser problem and its variants
Crossref DOI link: https://doi.org/10.1007/s10878-020-00608-x
Published Online: 2020-06-17
Published Print: 2022-11
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Xiao, Mingyu http://orcid.org/0000-0002-1012-2373
Zhang, Jianan
Lin, Weibo
Funding for this research was provided by:
National Natural Science Foundation of China (61972070, 61772115)
Text and Data Mining valid from 2020-06-17
Version of Record valid from 2020-06-17
Article History
First Online: 17 June 2020