Cost of sequential connection for points in space
type: Item
instance of: scholarly article
title: Cost of sequential connection for points in space
zbMATH Open document ID: 0675.90084
DOI: 10.1016/0167-6377(89)90039-4
author: J. Michael Steele
published in: Operations Research Letters
publication date: 1989-01-01T00:00:00Z
review text: A sequential minimal insertion procedure is used to produce a spanning tree, and the cost is estimated. The technique developed can also be used to the nearest neighbor heuristic for the traveling salseman problem and some other problems.
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 4106631
zbMATH Keywords: sequential minimal insertion procedure
zbMATH Keywords: spanning tree
zbMATH Keywords: nearest neighbor heuristic
zbMATH Keywords: traveling salseman
MaRDI profile type: MaRDI publication profile
full work available at URL: 0167-6377(89)90039-4
OpenAlex ID: W2101027188
cites work: Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space
cites work: Q3669332
cites work: The shortest path and the shortest road through n points
cites work: Steiner Minimal Trees
cites work: Peano curves and smoothness of functions
cites work: On the length of optimal TSP circuits in sets of bounded diameter
cites work: A problem seminar
cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem
Recommended article: On the point-to-point connection problem
Recommended article: On the connectivity of efficient point sets
Recommended article: On Connectivity Spaces
Recommended article: On connectedness via a sequential method
Recommended article: Q5716698
Recommended article: The point-to-point connection problem - analysis and algorithms
Recommended article: Efficient distance computation in configuration space
Recommended article: Pathwise Connectivity of the Spatial Numerical Range
Recommended article: Q5419953
Recommended article: The price of connectivity for feedback vertex set
description: scientific article; zbMATH DE number 4106631