A geometric problem involving the nearest neighbour algorithm

DOI10.1016/0167-6377(87)90045-9zbMath0629.90072OpenAlexW2081735182MaRDI QIDQ1094335

B. George

Publication date: 1987

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(87)90045-9

zbMATH Keywords

traveling salesman problemNearest Neighbour Algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (3)

Lower Bounds for Insertion Methods for TSP ⋮ On-line Steiner trees in the Euclidean plane ⋮ A travelling salesman problem in the \(k\)-dimensional unit cube

Cites Work

• Unnamed Item
• A problem seminar
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• The Traveling Salesman Problem: A Survey

This page was built for publication: A geometric problem involving the nearest neighbour algorithm