Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters

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]

Abstract

Abstract is missing.