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

Research output: Contribution to journal › Article › peer-review

Original language	English
Pages (from-to)	53-69
Number of pages	17
Journal	Annals of Mathematics and Artificial Intelligence
Volume	88
Issue number	1-3
DOIs	https://doi.org/10.1007/s10472-019-09626-w
Publication status	Published - 1 Mar 2020

Generalized traveling salesman problem, Polynomial time approximation scheme, Polynomial time solvable subclass, TSP, APPROXIMATION ALGORITHMS, SCHEMES, MST

ID: 11993823