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

科研成果: Article

4 引用 (Scopus)
源语言English
页(从-至)53-69
页数17
期刊Annals of Mathematics and Artificial Intelligence
88
1-3
DOI
Published - 1 三月 2020

ASJC Scopus subject areas

  • Artificial Intelligence
  • Applied Mathematics

WoS ResearchAreas Categories

  • Computer Science, Artificial Intelligence
  • Mathematics, Applied

指纹 探究 'Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters' 的科研主题。它们共同构成独一无二的指纹。

引用此