A travelling salesman problem in the k-dimensional unit cube

DOI10.1016/0167-6377(92)90057-AMaRDI QIDQ1198619zbMATH OpenFDO

Authors S. Singh

Publication date 16 January 1993

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

Full work available at URL https://doi.org/10.1016/0167-6377(92)90057-A

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• The Traveling Salesman Problem for Cubic Graphs
• The traveling salesman problem on cubic and subcubic graphs
• The traveling salesman problem on a graph and some related integer polyhedra
• The traveling salesman problem for cubic graphs.
• The Convex-hull-and-k-line Travelling Salesman Problem
• On the Travelling Salesperson Problem in Many Dimensions
• The n-line traveling salesman problem
• scientific article; zbMATH DE number 4053382
• On the Dubins Traveling Salesman Problem

Cites work

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

Cited in

(5)

• Lower Bounds for Insertion Methods for TSP
• On a traveling salesman problem for points in the unit cube
• On-line Steiner trees in the Euclidean plane
• On the length of optimal TSP circuits in sets of bounded diameter
• On distance sets of large sets of integer points

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1198619)