A note on heuristics for the traveling salesman problem
From MaRDI portal
Publication:3879044
DOI10.1007/BF01581633zbMath0437.90062MaRDI QIDQ3879044
Publication date: 1980
Published in: Mathematical Programming (Search for Journal in Brave)
approximation; heuristic algorithms; comparison of algorithms; worst case analysis; algorithmic performance; euclidean traveling salesman problem; ratio bounds
65K05: Numerical mathematical programming methods
90C10: Integer programming
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
Cites Work