{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,11]],"date-time":"2023-09-11T19:14:24Z","timestamp":1694459664739},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Biol. Cybern."],"published-print":{"date-parts":[[1994,3]]},"DOI":"10.1007\/bf00203241","type":"journal-article","created":{"date-parts":[[2004,8,31]],"date-time":"2004-08-31T06:38:17Z","timestamp":1093934297000},"page":"485-494","source":"Crossref","is-referenced-by-count":5,"title":["A neural network for the Steiner minimal tree problem"],"prefix":"10.1007","volume":"70","author":[{"family":"Jayadeva","sequence":"first","affiliation":[]},{"given":"Basabi","family":"Bhaumik","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF00203241_CR1","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0377-2217(92)90214-T","volume":"58","author":"JE Beasley","year":"1992","unstructured":"Beasley JE (1992) A heuristic for the euclidean and rectilinear Steiner problems. Eur J Oper Res 58:284\u2013292","journal-title":"Eur J Oper Res"},{"key":"BF00203241_CR2","doi-asserted-by":"crossref","unstructured":"Brandt RD, Wang Y, Laub AJ, Mitra SK (1988) Alternative networks for solving the travelling salesman problem and the list-matching problem. In: Caudill M, Butler C (eds) Proc. IEEE Int. Conf. Neural Networks, Vol II, pp 333\u2013339","DOI":"10.1109\/ICNN.1988.23945"},{"key":"BF00203241_CR3","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1145\/321724.321733","volume":"19","author":"SK Chang","year":"1972","unstructured":"Chang SK (1972) The generation of minimal trees with a Steiner topology. J Assoc. Comput. Machin. 19:669\u2013711","journal-title":"J Assoc. Comput. Machin"},{"key":"BF00203241_CR4","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0020-0190(86)90062-1","volume":"22","author":"EJ Cockayne","year":"1986","unstructured":"Cockayne EJ, Hewgill DE (1986) Exact computation of Steiner minimal trees in the plane. Inf Proc Lett 22:151\u2013156","journal-title":"Inf Proc Lett"},{"key":"BF00203241_CR5","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF01758759","volume":"7","author":"EJ Cockayne","year":"1992","unstructured":"Cockayne EJ, Hewgill DE (1992) Improved computation of plane Steiner minimal trees. Algorithmica 7:219\u2013229","journal-title":"Algorithmica"},{"key":"BF00203241_CR6","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1038\/326689a0","volume":"326","author":"R Durbin","year":"1987","unstructured":"Durbin R, Willshaw D (1987) An analogue approach to the travelling salesman problem using an elastic net method. Nature 326:689\u2013691","journal-title":"Nature"},{"key":"BF00203241_CR7","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1137\/0132072","volume":"32","author":"MR Garey","year":"1977","unstructured":"Garey MR, Graham RL, Johnson DS (1977) The complexity of computing Steiner minimal trees. SIAM J Appl Math 32:835\u2013859","journal-title":"SIAM J Appl Math"},{"key":"BF00203241_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0116001","volume":"16","author":"EN Gilbert","year":"1968","unstructured":"Gilbert EN, Pollak HO (1968) Steiner minimal trees. SIAM J Appl Math 16:1\u201329","journal-title":"SIAM J Appl Math"},{"key":"BF00203241_CR9","unstructured":"Hesser J, Manner R, Stucky O (1989) Optimization of Steiner trees using genetic algorithms. Proc. 3rd Intl. Conf. Genetic Algorithms, pp 231\u2013236"},{"key":"BF00203241_CR10","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00339943","volume":"52","author":"JJ Hopfield","year":"1985","unstructured":"Hopfield JJ, Tank DW (1985) Neural computation of decision optimization problems. Biol Cybern 52:141\u2013152","journal-title":"Biol Cybern"},{"key":"BF00203241_CR11","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1109\/TCS.1986.1085953","volume":"33","author":"JJ Hopfield","year":"1986","unstructured":"Hopfield JJ, Tank DW (1986) Simple \u201cneural\u201d optimization networks: an A\/D converter, signal decision circuit, and a linear programming circuit. IEEE Trans Circuits Syst 33:533\u2013541","journal-title":"IEEE Trans Circuits Syst"},{"key":"BF00203241_CR12","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/net.3230220105","volume":"22","author":"FK Hwang","year":"1992","unstructured":"Hwang FK, Richards DS (1992) Steiner tree problems. Networks 22:55\u201389","journal-title":"Networks"},{"key":"BF00203241_CR13","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF02187919","volume":"3","author":"FK Hwang","year":"1988","unstructured":"Hwang FK, Song GD, Ting GY, Du DZ (1988) A decomposition theorem on euclidean Steiner minimal trees. Disc Comput Geom 3:367\u2013382","journal-title":"Disc Comput Geom"},{"key":"BF00203241_CR14","first-page":"303","volume":"3","author":"FK Hwang","year":"1978","unstructured":"Hwang FK (1978) An O(n log n) algorithm for sub-optimal rectilinear Steiner trees. IEEE Trans Circuits Syst 3:303\u2013310","journal-title":"IEEE Trans Circuits Syst"},{"key":"BF00203241_CR15","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/BF00200988","volume":"67","author":"Jayadeva","year":"1992","unstructured":"Jayadeva, Bhaumik B (1992) Optimization with neural networks: a recipe for improving convergence and solution quality. Biol Cybern 67:445\u2013449","journal-title":"Biol Cybern"},{"key":"BF00203241_CR16","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal JB (1956) On the shortest spanning tree of a subgraph and the travelling salesman problem. Proc Am Math Soc 7:48\u201350","journal-title":"Proc Am Math Soc"},{"key":"BF00203241_CR17","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1093\/biomet\/72.1.191","volume":"72","author":"M Lundy","year":"1985","unstructured":"Lundy M (1985) Applications of the annealing algorithm to combinatorial problems in statics. Biometrika 72:191\u2013198","journal-title":"Biometrika"},{"key":"BF00203241_CR18","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim RC (1957) Shortest connection networks. Bell Syst Tech J 36:1389\u20131401","journal-title":"Bell Syst Tech J"},{"key":"BF00203241_CR19","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/net.3230110104","volume":"11","author":"JM Smith","year":"1981","unstructured":"Smith JM (1981) An O(n log n) heuristic algorithm for Steiner minimal tree problems on the Euclidean metric. Networks 11:23\u201339","journal-title":"Networks"},{"key":"BF00203241_CR20","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1080\/03052157908902401","volume":"4","author":"JM Smith","year":"1979","unstructured":"Smith JM, Gross M (1979) Steiner trees, Steiner circuits, and the interference problem in building design. Eng Optimization 4:15\u201336","journal-title":"Eng Optimization"},{"key":"BF00203241_CR21","first-page":"48","volume":"15","author":"J Soukup","year":"1978","unstructured":"Soukup J, Chow WF (1978) Set of test problems of the minimum length connection networks. SIGMAP Newsletter 15:48\u201351","journal-title":"SIGMAP Newsletter"},{"key":"BF00203241_CR22","doi-asserted-by":"crossref","unstructured":"Szu H (1988) Fast TSP algorithm based on binary neuron output and analog neuron input using the zero-diagonal interconnect matrix and necessary and sufficient constraints of the permutation matrix. in: Caudill M, Butler C (eds) Proc. IEEE Int. Conf. Neural Networks, Vol II, pp 259\u2013266","DOI":"10.1109\/ICNN.1988.23937"},{"key":"BF00203241_CR23","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1002\/net.3230150305","volume":"15","author":"P Winter","year":"1985","unstructured":"Winter P (1985) An algorithm for the Steiner tree problem in the euclidean plane. Networks 15:323\u2013345","journal-title":"Networks"},{"key":"BF00203241_CR24","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/net.3230170203","volume":"17","author":"P Winter","year":"1987","unstructured":"Winter P (1987) The Steiner tree problem in networks: a survey. Networks 17:129\u2013167","journal-title":"Networks"}],"container-title":["Biological Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00203241.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00203241\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00203241","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,29]],"date-time":"2023-04-29T07:51:46Z","timestamp":1682754706000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00203241"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":24,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["BF00203241"],"URL":"https:\/\/doi.org\/10.1007\/bf00203241","relation":{},"ISSN":["0340-1200","1432-0770"],"issn-type":[{"value":"0340-1200","type":"print"},{"value":"1432-0770","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}