A travelling salesman problem in the \(k\)-dimensional unit cube

DOI10.1016/0167-6377(92)90057-AzbMath0773.90080MaRDI QIDQ1198619

S. Singh

Publication date: 16 January 1993

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (2)

Lower Bounds for Insertion Methods for TSP ⋮ On-line Steiner trees in the Euclidean plane

Cites Work

• A geometric problem involving the nearest neighbour algorithm
• A problem seminar
• On the History of the Minimum Spanning Tree Problem

This page was built for publication: A travelling salesman problem in the \(k\)-dimensional unit cube