Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Michael Khachay, Katherine Neznakhina. Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters. Annals of Mathematics and Artificial Intelligence, 88(1):53-69, 2020. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Pseudo-pyramidal Tours and Efficient Solvability of the Euclidean Generalized Traveling Salesman Problem in Grid ClustersMichael Khachay, Katherine Neznakhina. lion 2019: 441-446 [doi] Polynomial Time Solvable Subclass of the Generalized Traveling Salesman Problem on Grid ClustersMichael Khachay, Katherine Neznakhina. aist 2018: 346-355 [doi]
The following publications are possibly variants of this publication: