Worst-case analysis of two travelling salesman heuristics
From MaRDI portal
Publication:786657
DOI10.1016/0167-6377(84)90078-6zbMath0528.90083MaRDI QIDQ786657
Publication date: 1984
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(84)90078-6
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
05C35: Extremal problems in graph theory
90C10: Integer programming
Related Items
Asymptotic expected performance of some TSP heuristics: An empirical evaluation, Heuristic methods and applications: A categorized survey, The traveling group problem
Cites Work