{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T03:49:59Z","timestamp":1673236199088},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1986,5,1]],"date-time":"1986-05-01T00:00:00Z","timestamp":515289600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Zeitschrift f\u00fcr Operations Research"],"published-print":{"date-parts":[[1986,5]]},"DOI":"10.1007\/bf01919172","type":"journal-article","created":{"date-parts":[[2005,7,23]],"date-time":"2005-07-23T03:28:56Z","timestamp":1122089336000},"page":"A85-A110","source":"Crossref","is-referenced-by-count":3,"title":["Euclidean matching problems and the metropolis algorithm"],"prefix":"10.1007","volume":"30","author":[{"given":"M.","family":"Weber","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Th. M.","family":"Liebling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01919172_CR1","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1017\/S0305004100034095","volume":"55","author":"J Beardwood","year":"1959","unstructured":"Beardwood J, Halton JH, Hammersley JM (1959) The shortest path through many points. Proc. of the Cambridge Phil. Society, voll 55, pp 299\u2013327","journal-title":"Proc. of the Cambridge Phil. Society"},{"key":"BF01919172_CR2","doi-asserted-by":"crossref","unstructured":"Bonomi E, Lutton JL (1984) The N-city travelling salesman problem: Statistical mechanics and the metropolis algorithm. SIAM Review 26\/4","DOI":"10.1137\/1026105"},{"key":"BF01919172_CR3","doi-asserted-by":"crossref","unstructured":"Burkard RE, Derigs U (1980) Assignment and matching problems: Solution methods with FORTRAN-programs. Lecture Notes in Economics and Mathematical Systems 184, Springer","DOI":"10.1007\/978-3-642-51576-7"},{"key":"BF01919172_CR4","volume-title":"A thermodynamical approach to the travelling salesman problem: an efficient simulation algorithm","author":"V Cerny","year":"1982","unstructured":"Cerny V (1982) A thermodynamical approach to the travelling salesman problem: an efficient simulation algorithm. Preprint, Inst. of Physics and Biophysics, Comenius Univ., Bratislava"},{"key":"BF01919172_CR5","doi-asserted-by":"crossref","unstructured":"Dyer ME, Frieze AM, McDiarmid CJH (1984) Partitioning heuristics for two geometric maximization problems. Operations Research Letters 3\/5","DOI":"10.1016\/0167-6377(84)90059-2"},{"key":"BF01919172_CR6","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds J (1965) Paths, trees and flowers. Canad J Math 17:449\u2013467, and Matching and a polyhedron with 0\u20131 vertices. J Res NBS 69B:125\u2013130","journal-title":"Canad J Math"},{"key":"BF01919172_CR7","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1109\/TPAMI.1984.4767596","volume":"6","author":"S Geman","year":"1984","unstructured":"Geman S, Geman D (1984) Stochastic relaxation, Gibbs distribution and Bayesian restoration of images. IEEE Trans Pattern Analysis and Machine Intelligence 6:721\u2013741","journal-title":"IEEE Trans Pattern Analysis and Machine Intelligence"},{"key":"BF01919172_CR8","unstructured":"Hajek B (1985) Cooling schedules for optimal annealing. To appear in Mathematics of OR"},{"key":"BF01919172_CR9","first-page":"67","volume":"13","author":"Masao Iri","year":"1983","unstructured":"Iri Masao, Marota Kazuo, Matsui Shouichi (1983) Neuristics for planar minimum-weight perfect matchings. Heuristics Networks 13:67\u201392","journal-title":"Heuristics Networks"},{"key":"BF01919172_CR10","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"22\/4598","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 22\/4598:671\u2013680","journal-title":"Science"},{"key":"BF01919172_CR11","unstructured":"Lutton JL, Bonomi E (1985) An efficient non-deterministic heuristic for the minimum weighted perfect matching problem: the Metropolis procedure"},{"key":"BF01919172_CR12","first-page":"368","volume":"15","author":"H Papadimitriou Christos","year":"1977","unstructured":"Papadimitriou Christos H (1977) The probabilistic analysis of matching algorithms. Proceedings of the Annual Allerton Conference on Communication, Control and Computing, vol 15, pp 368\u2013378","journal-title":"Control and Computing"},{"key":"BF01919172_CR13","unstructured":"Rossier Y, Troyon M, Liebling ThM (1985) Simulated annealing and the Euclidean traveling salemsan problem. Tech. Report RO 850 701, DMA EPF Lausanne"},{"key":"BF01919172_CR14","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1214\/aop\/1176994411","volume":"9\/3","author":"JM Steele","year":"1981","unstructured":"Steele JM (1981) Subadditive Euclidean functionals and nonlinear growth in geometric probability. The Annals of Probability 9\/3:365\u2013376","journal-title":"The Annals of Probability"}],"container-title":["Zeitschrift f\u00fcr Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01919172.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01919172\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01919172","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T09:27:30Z","timestamp":1586338050000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01919172"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,5]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1986,5]]}},"alternative-id":["BF01919172"],"URL":"https:\/\/doi.org\/10.1007\/bf01919172","relation":{},"ISSN":["0340-9422","1432-5217"],"issn-type":[{"value":"0340-9422","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,5]]}}}