Adrabinski, A.; Syslo, M. M. Computational experiments with some approximation algorithms for the travelling salesman problem. (English) Zbl 0525.90095 Zastosow. Mat. 18, 91-95 (1983). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 4 Documents MSC: 90C35 Programming involving graphs or networks 65K05 Numerical mathematical programming methods 90C10 Integer programming Keywords:computational experiments; heuristic algorithms; travelling salesman problem; farthest insertion method; Lin-Kernighan algorithm; combinatorial optimization; comparison of algorithms PDFBibTeX XMLCite \textit{A. Adrabinski} and \textit{M. M. Syslo}, Zastosow. Mat. 18, 91--95 (1983; Zbl 0525.90095)