{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T09:58:46Z","timestamp":1648720726777},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1990,7,1]],"date-time":"1990-07-01T00:00:00Z","timestamp":646790400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ZOR - Methods and Models of Operations Research"],"published-print":{"date-parts":[[1990,7]]},"DOI":"10.1007\/bf01416735","type":"journal-article","created":{"date-parts":[[2005,4,12]],"date-time":"2005-04-12T13:22:07Z","timestamp":1113312127000},"page":"239-253","source":"Crossref","is-referenced-by-count":0,"title":["An efficient heuristic algorithm for minimum matching"],"prefix":"10.1007","volume":"34","author":[{"given":"P.","family":"Grassberger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Freund","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1002\/net.3230130406","volume":"13","author":"MO Ball","year":"1983","unstructured":"Ball MO, Derigs U (1983) An analysis of alternate strategies for implementing matching algorithms. Networks 13:517?549","journal-title":"Networks"},{"key":"CR2","first-page":"673","volume":"A15","author":"F Barahona","year":"1982","unstructured":"Barahona F, Maynard R, Rammal R, Uhry JP (1982) Morphology of ground states of two-dimensional frustration models. J Phys A15:673?699","journal-title":"J Phys"},{"key":"CR3","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 Cambridge Phil Soc 55:299?327","journal-title":"Proc Cambridge Phil Soc"},{"key":"CR4","first-page":"2553","volume":"A13","author":"I Bieche","year":"1980","unstructured":"Bieche I, Maynard R, Rammal R, Uhry JP (1980) On the ground states of the frustration model of a spin glass by a matching method of graph theory. J Phys A13:2553?2576","journal-title":"J Phys"},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"Burkard RE, Derigs U (1980) Assignment and matching problems: solution methods and FORTRAN programs. Lecture Notes in Economics and Mathematical Systems 184, Springer","DOI":"10.1007\/978-3-642-51576-7"},{"key":"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?465","journal-title":"Canad J Math"},{"key":"CR7","first-page":"L801","volume":"A21","author":"H Freund","year":"1988","unstructured":"Freund H, Grassberger P (1988) Multispin-coding for spin-glasses. J Phys A21:L801-L805","journal-title":"J Phys"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"4045","DOI":"10.1088\/0305-4470\/22\/18\/036","volume":"A 22","author":"H Freund","year":"1989","unstructured":"Freund H, Grassberger P (1989) The ground state of the \u00b1J spin-glass from a heuristic matching algorithm. J Phys A 22:4045?4059","journal-title":"J Phys"},{"key":"CR9","first-page":"255","volume-title":"Priority queues with variable priority and anO(EV logV) algorithm for finding a maximal weighted matching in general graphs","author":"Z Galil","year":"1982","unstructured":"Galil Z, Micali S, Gabow H (1982) Priority queues with variable priority and anO(EV logV) algorithm for finding a maximal weighted matching in general graphs. Proc. 23rd Ann. Symp. on Foundations of Computer Science, Chicago. IEEE Computer Soc. Press, New York, pp 255?261"},{"key":"CR10","volume-title":"Computers and intractability: a guide to NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to NP-completeness. Freeman, New York"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"1148","DOI":"10.1103\/PhysRevLett.56.1148","volume":"56","author":"GS Grest","year":"1986","unstructured":"Grest GS, Soukoulis CM, Levin K (1986) Cooling rate dependence for the spin-glass ground state energy. Phys Rev Lett 56:1148?1151","journal-title":"Phys Rev Lett"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"2203","DOI":"10.1103\/PhysRevLett.57.2203","volume":"57","author":"DA Huse","year":"1986","unstructured":"Huse DA, Fisher DS (1986) Residual energies after slow cooling of disordered systems. Phys Rev Lett 57:2203?2206","journal-title":"Phys Rev Lett"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"1591","DOI":"10.1103\/PhysRevLett.60.1591","volume":"60","author":"D Kandel","year":"1988","unstructured":"Kandel D, Domany E, Ron D, Brandt A, Loh E (1988) Simulation without critical slowing down. Phys Rev Lett 60:1591?1594","journal-title":"Phys Rev Lett"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671?680","journal-title":"Science"},{"key":"CR15","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 BW (1973) An effective heuristic algorithm for the travelling salesman problem. Oper Res 21:498?516","journal-title":"Oper Res"},{"key":"CR16","first-page":"177","volume":"20","author":"JL Lutton","year":"1986","unstructured":"Lutton JL, Bonomi E (1986) Simulated annealing algorithm for the minimum weighted perfect Euclidean matching problem. Recherche Op\u00e9rationnelle 20:177?197","journal-title":"Recherche Op\u00e9rationnelle"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"L771","DOI":"10.1051\/jphyslet:019850046017077100","volume":"46","author":"M M\u00e9zard","year":"1985","unstructured":"M\u00e9zard M, Parisi G (1985) Replicas and optimization. J Phys (Paris) Lett 46:L771-L778","journal-title":"J Phys (Paris) Lett"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1209\/0295-5075\/2\/12\/005","volume":"2","author":"M M\u00e9zard","year":"1986","unstructured":"M\u00e9zard M, Parisi G (1986) Mean field equations for the matching and the travelling salesman problems. Europhys Lett 2:913?918","journal-title":"Europhys Lett"},{"key":"CR19","first-page":"368","volume":"15","author":"CH Papadimitriou","year":"1977","unstructured":"Papadimitriou CH (1977) The probabilistic analysis of matching algorithms. Proc. of Allerton Conf. on Communication, Control and Computing, vol 15, pp 368?378","journal-title":"Proc. of Allerton Conf. on Communication, Control and Computing"},{"key":"CR20","volume-title":"Combinatorial optimization algorithms","author":"CH Papadimitriou","year":"1982","unstructured":"Papadimitriou CH, Steiglitz K (1982) Combinatorial optimization algorithms. Prentice-Hall, New Jersey"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"2607","DOI":"10.1103\/PhysRevLett.57.2607","volume":"57","author":"RH Swendsen","year":"1986","unstructured":"Swendsen RH, Wang J-S (1986) Replica Monte Carlo simulations of spin-glasses. Phys Rev Lett 57:2607?2609","journal-title":"Phys Rev Lett"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1103\/PhysRevLett.58.86","volume":"58","author":"RH Swendsen","year":"1987","unstructured":"Swendsen RH, Wang J-S (1987) Nonuniversal critical dynamics in Monte Carlo simulations. Phys Rev Lett 58:86?88","journal-title":"Phys Rev Lett"},{"key":"CR23","first-page":"115","volume":"2","author":"G Toulouse","year":"1977","unstructured":"Toulouse G (1977) Theory of the frustration effect in spin glasses. Commun Phys 2:115?119","journal-title":"Commun Phys"},{"key":"CR24","first-page":"A85","volume":"30","author":"M Weber","year":"1986","unstructured":"Weber M, Liebling ThM (1986) Euclidean matching problems and the metropolis algorithm. Zeitschr f Operations Res 30:A85-A110","journal-title":"Zeitschr f Operations Res"}],"container-title":["ZOR Zeitschrift f\ufffd Operations Research Methods and Models of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01416735.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01416735\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01416735","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T19:42:40Z","timestamp":1586202160000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01416735"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,7]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1990,7]]}},"alternative-id":["BF01416735"],"URL":"https:\/\/doi.org\/10.1007\/bf01416735","relation":{},"ISSN":["0340-9422","1432-5217"],"issn-type":[{"value":"0340-9422","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,7]]}}}