{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:12:26Z","timestamp":1725574346465},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540238065"},{"type":"electronic","value":"9783540304982"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30498-2_79","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T19:21:59Z","timestamp":1294428119000},"page":"788-798","source":"Crossref","is-referenced-by-count":0,"title":["Bidirectional Neural Network for Clustering Problems"],"prefix":"10.1007","author":[{"given":"Enrique","family":"Dom\u00ednguez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9","family":"Mu\u00f1oz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"79_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1023\/A:1026130003508","volume":"122","author":"O. Alp","year":"2003","unstructured":"Alp, O., Erkut, E., Drezner, Z.: An efficient genetic algorithm for the p-median problem. Annals of Operations Research\u00a0122, 21\u201342 (2003)","journal-title":"Annals of Operations Research"},{"issue":"5","key":"79_CR2","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1109\/72.248463","volume":"4","author":"Z. Bai-Ling","year":"1993","unstructured":"Bai-Ling, Z., Bing-Zheng, X., Chung-Ping, K.: Performance analysis of the bidirectional associative memory and an improved model from the matched-filtering viewpoint. IEEE Transactions on Neural Networks\u00a04(5), 864\u2013872 (1993)","journal-title":"IEEE Transactions on Neural Networks"},{"key":"79_CR3","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/0377-2217(81)90095-3","volume":"7","author":"E. Bartezzaghi","year":"1981","unstructured":"Bartezzaghi, E., Colorni, A.: A search tree algorithm for plant location problems. European Journal of Operational Research\u00a07, 371\u2013379 (1981)","journal-title":"European Journal of Operational Research"},{"key":"79_CR4","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/0377-2217(82)90160-6","volume":"10","author":"N. Christofides","year":"1982","unstructured":"Christofides, N., Beasley, J.E.: A tree search algorithm for the problem pmediates. European Journal of Operational Research\u00a010, 196\u2013204 (1982)","journal-title":"European Journal of Operational Research"},{"key":"79_CR5","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF01434270","volume":"71","author":"P. Densham","year":"1992","unstructured":"Densham, P., Rusthon, G.: A more efficient heuristic for solving large pmedian problems. Paper in Regional Science\u00a071, 207\u2013239 (1992)","journal-title":"Paper in Regional Science"},{"key":"79_CR6","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0377-2217(98)00084-8","volume":"116","author":"Z. Drezner","year":"1999","unstructured":"Drezner, Z., Guyse, J.: Application of decision analysis to the Weber facility location problem. European Journal of Operational Research\u00a0116, 69\u201379 (1999)","journal-title":"European Journal of Operational Research"},{"key":"79_CR7","volume-title":"Facility location: applications and theory","author":"Z. Drezner","year":"2003","unstructured":"Drezner, Z., Hamacher, H.W.: Facility location: applications and theory. Springer, Heidelberg (2003)"},{"key":"79_CR8","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1038\/326689a0","volume":"326","author":"R. Durbin","year":"1987","unstructured":"Durbin, R., Willshaw, D.: An analogue approach to the travelling salesman problem using an elastic net method. Nature\u00a0326, 689\u2013691 (1987)","journal-title":"Nature"},{"key":"79_CR9","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/BF00202610","volume":"64","author":"F. Favata","year":"1991","unstructured":"Favata, F., Walker, R.: A study of the application of the Kohonen-type neural networks to the travelling salesman problem. Biological Cybernetics\u00a064, 463\u2013468 (1991)","journal-title":"Biological Cybernetics"},{"key":"79_CR10","doi-asserted-by":"publisher","first-page":"1112","DOI":"10.1287\/opre.28.5.1112","volume":"28","author":"R.D. Galvao","year":"1980","unstructured":"Galvao, R.D.: A dual-bounded algorithm for the problem p-mediates. Operations Research\u00a028, 1112\u20131121 (1980)","journal-title":"Operations Research"},{"issue":"1","key":"79_CR11","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1109\/72.363424","volume":"6","author":"A.H. Gee","year":"1995","unstructured":"Gee, A.H., Prager, R.W.: Limitations of neural networks for solving traveling salesman problems. IEEE Transactions on Neural Networks\u00a06(1), 280\u2013282 (1995)","journal-title":"IEEE Transactions on Neural Networks"},{"key":"79_CR12","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1016\/0377-2217(85)90012-8","volume":"20","author":"P. Hanjoul","year":"1985","unstructured":"Hanjoul, P., Peeters, D.: A comparison of two dual-based procedures for solving the p-median problem. European Journal of Operational Research\u00a020, 386\u2013396 (1985)","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"79_CR13","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0966-8349(98)00030-8","volume":"5","author":"P. Hansen","year":"1997","unstructured":"Hansen, P., Mladenovic, N.: Variable neighborhood search for the p-median problem. Location Science\u00a05(4), 141\u2013152 (1997)","journal-title":"Location Science"},{"key":"79_CR14","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00339943","volume":"52","author":"J. Hopfield","year":"1985","unstructured":"Hopfield, J., Tank, D.: Neural computation of decisions in optimization problems. Biological Cybernetics\u00a052, 141\u2013152 (1985)","journal-title":"Biological Cybernetics"},{"key":"79_CR15","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1016\/S0377-2217(96)00218-4","volume":"101","author":"M. Hribar","year":"1997","unstructured":"Hribar, M., Daskin, M.S.: A dynamic programming heuristic for the problem p-mediates. European Journal of Operational Research\u00a0101, 499\u2013508 (1997)","journal-title":"European Journal of Operational Research"},{"key":"79_CR16","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0925-2312(02)00627-6","volume":"51","author":"D.L. Hung","year":"2003","unstructured":"Hung, D.L., Wang, J.: Digital hardware realization of a recurrent neural network for solving the assignment problem. Neurocomputing\u00a051, 447\u2013461 (2003)","journal-title":"Neurocomputing"},{"key":"79_CR17","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O. Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, S.L.: An Algorithmic Approach to Network Location Problem. Part 2: The p-Median. SIAM J. Appl. Math.\u00a037, 539\u2013560 (1979)","journal-title":"Part 2: The p-Median. SIAM J. Appl. Math."},{"issue":"12","key":"79_CR18","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1287\/mnsc.18.12.B718","volume":"18","author":"B.M. Khumawala","year":"1972","unstructured":"Khumawala, B.M.: An efficient branch and bound algorithm for the warehouse location problem. Management Science\u00a018(12), 718\u2013731 (1972)","journal-title":"Management Science"},{"issue":"1","key":"79_CR19","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1109\/21.87054","volume":"18","author":"B. Kosko","year":"1988","unstructured":"Kosko, B.: Bidirectional associative memories. IEEE Transactions on Systems, Man and Cybernetics\u00a018(1), 49\u201360 (1988)","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"79_CR20","volume-title":"Digital neural networks","author":"S. Kung","year":"1993","unstructured":"Kung, S.: Digital neural networks, New Jersey (USA). Prentice-Hall, Englewood Cliffs (1993)"},{"key":"79_CR21","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/S0377-2217(96)00141-5","volume":"96","author":"E. Rolland","year":"1997","unstructured":"Rolland, E., Schilling, D., Current, J.P.: An efficient tabu search procedure for the p-median problem. European Journal of Operational Research\u00a096, 329\u2013342 (1997)","journal-title":"European Journal of Operational Research"},{"key":"79_CR22","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0377-2217(96)00100-2","volume":"97","author":"K.E. Rosing","year":"1997","unstructured":"Rosing, K.E., ReVelle, C.S.: Heuristic concentration: two stage solution construction. European Journal of Operational Research\u00a097, 75\u201386 (1997)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"79_CR23","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1109\/72.363476","volume":"6","author":"S. Shams","year":"1995","unstructured":"Shams, S., Gaudiot, J.-L.: Implementing regularly structured neural networks on the DREAM machine. IEEE Transactions on Neural Networks\u00a06(2), 407\u2013421 (1995)","journal-title":"IEEE Transactions on Neural Networks"},{"issue":"6","key":"79_CR24","doi-asserted-by":"publisher","first-page":"1301","DOI":"10.1109\/72.728380","volume":"9","author":"K. Smith","year":"1998","unstructured":"Smith, K., Palaniswani, M., Krishnamoorthy, M.: Neural techniques for combinatorial optimization with applications. IEEE Transactions on Neural Networks\u00a09(6), 1301\u20131318 (1998)","journal-title":"IEEE Transactions on Neural Networks"},{"issue":"6","key":"79_CR25","doi-asserted-by":"publisher","first-page":"1542","DOI":"10.1109\/72.548187","volume":"7","author":"K. Smith","year":"1996","unstructured":"Smith, K.: An argument for abandoning the travelling salesman problem as a neural-network benchmark. IEEE Transactions on Neural Networks\u00a07(6), 1542\u20131544 (1996)","journal-title":"IEEE Transactions on Neural Networks"},{"key":"79_CR26","doi-asserted-by":"publisher","first-page":"955","DOI":"10.1287\/opre.16.5.955","volume":"16","author":"M.B. Teitz","year":"1968","unstructured":"Teitz, M.B., Bart, P.: Heuristic methods for estimating the generalized vertex median of a weighted graph. Operations Research\u00a016, 955\u2013961 (1968)","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence \u2013 IBERAMIA 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30498-2_79.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T15:53:25Z","timestamp":1685894005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30498-2_79"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540238065","9783540304982"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30498-2_79","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}