Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters
Crossref DOI link: https://doi.org/10.1007/s10472-019-09626-w
Published Online: 2019-03-28
Published Print: 2020-03
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Khachay, Michael http://orcid.org/0000-0003-3555-0080
Neznakhina, Katherine
Funding for this research was provided by:
Russian Science Foundation (14-11-00109)
Text and Data Mining valid from 2019-03-28
Article History
First Online: 28 March 2019