On the nearest neighbor rule for the metric traveling salesman problem
From MaRDI portal
Publication:496440
DOI10.1016/j.dam.2014.03.012zbMath1331.90068arXiv1401.2071OpenAlexW2963876309MaRDI QIDQ496440
Publication date: 21 September 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.2071
Related Items
THE NEAREST UNVISITED VERTEX WALK ON RANDOM GRAPHS, Truly tight bounds for TSP heuristics, Exploring Endless Space, The approximation ratio of the greedy algorithm for the metric traveling salesman problem, IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem
Cites Work