{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:25:00Z","timestamp":1725456300094},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540587125"},{"type":"electronic","value":"9783540490500"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/bfb0030151","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T06:19:55Z","timestamp":1133417995000},"page":"229-235","source":"Crossref","is-referenced-by-count":0,"title":["A new algorithm for the traveling salesman problem on networked workstations"],"prefix":"10.1007","author":[{"given":"M.","family":"Gajecki","sequence":"first","affiliation":[]},{"given":"J.","family":"Mo\u015bci\u0144ski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"22_CR1","volume-title":"Computers and intractability: a guide to the theory of NP-completess","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S., \u201cComputers and intractability: a guide to the theory of NP-completess\u201d, W.H. Freeman, San Francisco, 1979."},{"key":"22_CR2","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1057\/jors.1975.151","volume":"26","author":"J.K. Lenstra","year":"1975","unstructured":"Lenstra, J.K., Rinnooy Kan, A.H.G.,\u201cSome Simple Application of the Traveling Salesman Problem\u201d, Oper. Res 26, 717\u2013733, (1975).","journal-title":"Oper. Res"},{"key":"22_CR3","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0377-2217(92)90138-Y","volume":"59","author":"G. Laporte","year":"1992","unstructured":"Laporte, G., \u201cThe Traveling Salesman Problem: An overview of exact and approximate algorithms\u201d, European Journal of Operational Research, 59, (1992) 231\u2013247.","journal-title":"European Journal of Operational Research"},{"key":"22_CR4","volume-title":"Tech. Rep.","author":"N. Christofides","year":"1980","unstructured":"Christofides, N., \u201cThe traveling salesman problem \u2014 survey\u201d, Tech. Rep., Imperial Collage, London, 1980"},{"key":"22_CR5","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1002\/cpe.4330020404","volume":"2","author":"V.S. Sunderam","year":"1990","unstructured":"Sunderam, V.S., \u201cPVM: a framework for parallel distributed computing\u201d, Concurrency: Practice and Experience, 2 (1990) 315\u2013339.","journal-title":"Concurrency: Practice and Experience"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Geist, A. Beguelin, A., Dongarra, J., Jiang, W., Manchek, R., and Sunderam, V., \u201cPVM 3.0 A users' guide and reference manual\u201d, ORNL\/TM-12187, USA (February, 1993).","DOI":"10.7551\/mitpress\/5712.001.0001"},{"key":"22_CR7","unstructured":"G. Reinelt, TSPLIB 1.0, Contact: bixby@rice.edu."},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Lin, S., \u201cComputer solution of the traveling salesman problem\u201d, The Bell System Technical Journal, December 1965, 2245\u20132269.","DOI":"10.1002\/j.1538-7305.1965.tb04146.x"},{"key":"22_CR9","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0021-9991(90)90201-B","volume":"90","author":"G. Dueck","year":"1990","unstructured":"Dueck, G., Sheuler, T., \u201cThreshold accepting: a general purpose optimization algorithm appearing superior to simulated anniealing\u201d, Journal of Computational Physics, 90 (1990) 161\u2013175.","journal-title":"Journal of Computational Physics"},{"key":"22_CR10","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W., \u201cAn effective heuristic algorithm for the traveling salesman problem\u201d, Oper. Res. 21, 498\u2013516 (1973).","journal-title":"Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Parallel Scientific Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030151","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:21:25Z","timestamp":1586593285000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0030151"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540587125","9783540490500"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0030151","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}