A neural network for the Steiner minimal tree problem
type: Item
instance of: scholarly article
title: A neural network for the Steiner minimal tree problem
zbMATH Open document ID: 0805.68107
DOI: 10.1007/BF00203241
author: Basabi Bhaumik Jayadeva
published in: Biological Cybernetics
publication date: 1995-01-26T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 579932
zbMATH Keywords: minimal spanning tree
zbMATH Keywords: Steiner minimal tree
zbMATH Keywords: NP-complete
zbMATH Keywords: neural network
MaRDI profile type: Publication
cites work: A heuristic for Euclidean and rectilinear Steiner problems
cites work: The Generation of Minimal Trees with a Steiner Topology
cites work: Exact computation of Steiner minimal trees in the plane
cites work: Improved computation of plane Steiner minimal trees
cites work: The Complexity of Computing Steiner Minimal Trees
cites work: Steiner Minimal Trees
cites work: ``Neural'' computation of decisions in optimization problems
cites work: Steiner tree problems
cites work: A decomposition theorem on Euclidean Steiner minimal trees
cites work: Optimization with neural networks: A recipe for improving convergence and solution quality
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: An O(n logn) heuristic for steiner minimal tree problems on the euclidean metric
cites work: An algorithm for the steiner problem in the euclidean plane
cites work: Steiner problem in networks: A survey
description: scientific article; zbMATH DE number 579932