Assignment problem based algorithms are impractical for the generalized TSP

Gregory Gutin, Anders Yeo

Research output: Contribution to journalArticlepeer-review

66 Downloads (Pure)
Original languageEnglish
Pages (from-to)149-154
JournalAustralasian Journal of Combinatorics
Volume27
Publication statusPublished - 2003

Keywords

  • Traveling Salesman Problem
  • algorithm
  • digraph
  • vertex
  • partition

Cite this