{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T21:39:59Z","timestamp":1775079599634,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1973,12,1]],"date-time":"1973-12-01T00:00:00Z","timestamp":123552000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1973,12]]},"DOI":"10.1007\/bf01580113","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T05:58:49Z","timestamp":1114667929000},"page":"88-124","source":"Crossref","is-referenced-by-count":748,"title":["Matching, Euler tours and the Chinese postman"],"prefix":"10.1007","volume":"5","author":[{"given":"Jack","family":"Edmonds","sequence":"first","affiliation":[]},{"given":"Ellis L.","family":"Johnson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","first-page":"203","volume":"28","author":"Aardenne-Ehrenfest van","year":"1951","unstructured":"van Aardenne-Ehrenfest and N.G. de Bruijn, \u201cCircuits and trees in oriented graphs\u201d,Simon Stevin 28 (1951) 203\u2013217.","journal-title":"Simon Stevin"},{"key":"CR2","volume-title":"\u201cNetworks and vehicle routing for municipal waste collection\u201d, Report No. UPS 72-18","author":"E.J. Beltrami","year":"1972","unstructured":"E.J. Beltrami and L.D. Bodin, \u201cNetworks and vehicle routing for municipal waste collection\u201d, Report No. UPS 72-18, State University of New York, Stony Brook, N.Y. (1972)."},{"key":"CR3","volume-title":"The theory of graphs and its applications","author":"C. Berge","year":"1962","unstructured":"C. Berge,The theory of graphs and its applications (Wiley, New York, 1962)."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds, \u201cPaths, trees and flowers\u201d,Canadian Journal of Mathematics 17 (1965) 449\u2013467.","journal-title":"Canadian Journal of Mathematics"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"1","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds, \u201cMaximum matching and a polyhedron with 0, 1-vertices\u201d,Journal of Research of the National Bureau of Standards Section B, 1, 2 (1965) 125\u2013130.","journal-title":"Journal of Research of the National Bureau of Standards Section B"},{"issue":"Suppl. 1","key":"CR6","first-page":"373","volume":"13","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds, \u201cThe Chinese postman problem\u201d,Operations Research 13 Suppl. 1 (1965) 373.","journal-title":"Operations Research"},{"key":"CR7","first-page":"89","volume-title":"Combinatorial structures and their applications","author":"J. Edmonds","year":"1970","unstructured":"J. Edmonds and E.L. Johnson, \u201cMatching: a well-solved class of integer linear programs\u201d, in:Combinatorial structures and their applications (Gordon and Breach, New York, 1970) 89\u201392."},{"key":"CR8","unstructured":"J. Edmonds, E.L. Johnson and S. Lockhart, \u201cBlossom I: a computer code for the matching problem\u201d, to appear."},{"key":"CR9","first-page":"128","volume":"8","author":"L. Euler","year":"1736","unstructured":"L. Euler, \u201cSolutio problematis ad geometriam situs pertinentis\u201d,Commentarii Academiae Petropolitanae 8 (1736) 128\u2013140.","journal-title":"Commentarii Academiae Petropolitanae"},{"key":"CR10","volume-title":"Flows in networks","author":"L.R. Ford Jr.","year":"1962","unstructured":"L.R. Ford Jr. and D.R. Fulkerson,Flows in networks (Princeton Univ. Press, Princeton, N.J., 1962)."},{"key":"CR11","volume-title":"Proceedings of Symposia on Applied Mathematics Vol. 10","author":"A.J. Hoffman","year":"1960","unstructured":"A.J. Hoffman, \u201cSome recent applications of the theory of linear inequalities to extremal combinatorial analysis\u201d, in:Proceedings of Symposia on Applied Mathematics Vol. 10 (American Mathematical Society, Providence, R.I., 1960)."},{"key":"CR12","first-page":"207","volume":"15","author":"T.C. Hu","year":"1967","unstructured":"T.C. Hu, \u201cRevised matrix algorithms for shortest paths in a network\u201c,SIAM Journal 15 (1967) 207\u2013218.","journal-title":"SIAM Journal"},{"key":"CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-95161-9","volume-title":"Graphentheorie in Planungs- und Tourenproblemen, Lecture Notes in Operations Research and Mathematical Systems 21","author":"T.M. Liebling","year":"1970","unstructured":"T.M. Liebling,Graphentheorie in Planungs- und Tourenproblemen, Lecture Notes in Operations Research and Mathematical Systems 21 (Springer, Berlin, 1970)."},{"key":"CR14","first-page":"273","volume":"1","author":"K. Mei-Ko","year":"1962","unstructured":"K. Mei-Ko, \u201cGraphic programming using odd or even points\u201d,Chinese Mathematics 1 (1962) 273\u2013277.","journal-title":"Chinese Mathematics"},{"key":"CR15","volume-title":"Routing and scheduling a fleet of vehicles to\/from central facilities \u2014 the school bus problem","author":"C.S. Orloff","year":"1972","unstructured":"C.S. Orloff, \u201cRouting and scheduling a fleet of vehicles to\/from central facilities \u2014 the school bus problem\u201d, Ph. D. Thesis, Cornell University, Ithaca, N.Y. (1972)."},{"key":"CR16","volume-title":"Public sector vehicle routing: the Chinese postman problem","author":"R. Stricker","year":"1970","unstructured":"R. Stricker, \u201cPublic sector vehicle routing: the Chinese postman problem\u201d, Master Thesis, Massachusetts Institute of Technology, Cambridge, Mass. (August 1970)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580113.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01580113\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580113","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:09:13Z","timestamp":1556881753000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01580113"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1973,12]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1973,12]]}},"alternative-id":["BF01580113"],"URL":"https:\/\/doi.org\/10.1007\/bf01580113","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1973,12]]}}}