Assignment problem based algorithms are impractical for the generalized TSP

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

95 Downloads (Pure)

Original language	English
Pages (from-to)	149-154
Journal	Australasian Journal of Combinatorics
Volume	27
Publication status	Published - 2003

Keywords

@article{d6f265fa0ce6448aa8c053b07031cd7d,

title = "Assignment problem based algorithms are impractical for the generalized TSP",

keywords = "Traveling Salesman Problem, algorithm, digraph, vertex, partition",

author = "Gregory Gutin and Anders Yeo",

year = "2003",

language = "English",

volume = "27",

pages = "149--154",

journal = "Australasian Journal of Combinatorics",

issn = "1034-4942",

publisher = "University of Queensland Press",

}

TY - JOUR

T1 - Assignment problem based algorithms are impractical for the generalized TSP

AU - Gutin, Gregory

AU - Yeo, Anders

PY - 2003

Y1 - 2003

KW - Traveling Salesman Problem

KW - algorithm

KW - digraph

KW - vertex

KW - partition

M3 - Article

SN - 1034-4942

VL - 27

SP - 149

EP - 154

JO - Australasian Journal of Combinatorics

JF - Australasian Journal of Combinatorics

ER -