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

Research output: Contribution to journalArticle

3 Citations (Scopus)
Original languageEnglish
Pages (from-to)53-69
Number of pages17
JournalAnnals of Mathematics and Artificial Intelligence
Volume88
Issue number1-3
DOIs
Publication statusPublished - 1 Mar 2020

Keywords

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

ASJC Scopus subject areas

  • Artificial Intelligence
  • Applied Mathematics

WoS ResearchAreas Categories

  • Computer Science, Artificial Intelligence
  • Mathematics, Applied

Fingerprint Dive into the research topics of 'Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters'. Together they form a unique fingerprint.

Cite this