×
Hong, S.

The asymmetric travelling salesman problem and spanning arborescences of directed graphs. (English) Zbl 0394.90063

Operations Research Verfahren XXV, Symp. Heidelberg 1976, Teil 1, 192-204 (1977).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0394.90063

Cited in 1 Document

MSC:

90C08 Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)
90C35 Programming involving graphs or networks
05C20 Directed graphs (digraphs), tournaments
65K05 Numerical mathematical programming methods
94C15 Applications of graph theory to circuits and networks

Keywords:

Algorithm; Asymmetric Travelling Salesman; Efficiency; Computational

Citations:

Zbl 0386.00012
Cite Review PDF