{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:40:02Z","timestamp":1752378002184,"version":"3.41.2"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1023\/a:1018350224084","type":"journal-article","created":{"date-parts":[[2003,2,6]],"date-time":"2003-02-06T17:08:17Z","timestamp":1044551297000},"page":"229-247","source":"Crossref","is-referenced-by-count":3,"title":["Finding Postal Carrier Walk Paths in Mixed Graphs"],"prefix":"10.1007","volume":"9","author":[{"given":"Hong","family":"Yan","sequence":"first","affiliation":[]},{"given":"Gerald L.","family":"Thompson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"150475_CR1","first-page":"375","volume-title":"Network Routing, Handbooks in Operations Research and Management Science","author":"A.A. Assad","year":"1995","unstructured":"A.A. Assad and B.L. Golden, \u201cArc routing methods and applications,\u201d in Network Routing, Handbooks in Operations Research and Management Science, M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser (Eds.), Elsevier: Amsterdam, New York, 1995, pp. 375-483."},{"key":"150475_CR2","first-page":"354","volume-title":"Graph Theoretic Concepts in Computer Science","author":"P. Brucker","year":"1981","unstructured":"P. Brucker, \u201cThe Chinese postman problem for mixed graphs,\u201d in Graph Theoretic Concepts in Computer Science, H. Noltemeier (Ed.), Springer: Berlin, 1981, pp. 354-366."},{"key":"150475_CR3","volume-title":"Graph Theory-An Algorithmic Approach","author":"N. Christofides","year":"1975","unstructured":"N. Christofides, Graph Theory-An Algorithmic Approach, Academic Press: New York, 1975."},{"key":"150475_CR4","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01580113","volume":"5","author":"J. Edmonds","year":"1973","unstructured":"J. Edmonds and E. Johnson, \u201cMatching, Euler tours and the Chinese postman problem,\u201d Mathematical Programming, vol. 5, pp. 88-124, 1973.","journal-title":"Mathematical Programming"},{"key":"150475_CR5","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1287\/opre.43.2.231","volume":"43","author":"H.A. Eiselt","year":"1995","unstructured":"H.A. Eiselt, M. Gendreau, and G. Laporte, \u201cArc routing problems, Part I: The Chinese routing problem,\u201d Operations Research, vol. 43, pp. 231-242, 1995.","journal-title":"Operations Research"},{"key":"150475_CR6","volume-title":"Flows in Networks","author":"L.R. Ford","year":"1962","unstructured":"L.R. Ford and D.R. Fulkerson, Flows in Networks, Princeton University Press: Princeton, NJ, 1962."},{"key":"150475_CR7","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1145\/322139.322150","volume":"26","author":"G.N. Frederickson","year":"1979","unstructured":"G.N. Frederickson, \u201cApproximation algorithms for some postman problems,\u201d Journal of Association for Computing Machinery, vol. 26, pp. 538-554, 1979.","journal-title":"Journal of Association for Computing Machinery"},{"unstructured":"M. Gendreau, G. Laporte, and Y. Zhao, \u201cThe windy postman problem on general graphs,\u201d Working paper, Centre de recherche sur les transports, Universite de Montreal, 1990.","key":"150475_CR8"},{"unstructured":"M. Grotschel and Z. Win, \u201cOn the windy postman polyhedron,\u201d Report No. 75, Schwerpunktprogram des deutschen Forschungsgemeinschaft, Universitat Augsburg, 1988.","key":"150475_CR9"},{"key":"150475_CR10","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF01581206","volume":"55","author":"M. Grotschel","year":"1992","unstructured":"M. Grotschel and Z. Win, \u201cA cutting plane algorithm for the windy postman problem,\u201d Mathematical Programming, vol. 55, pp. 339-358, 1992.","journal-title":"Mathematical Programming"},{"key":"150475_CR11","first-page":"237","volume":"1","author":"M. Guan","year":"1962","unstructured":"M. Guan, \u201cGraphic programming using odd and even points,\u201d Chinese Mathematics, vol. 1, pp. 237-277, 1962.","journal-title":"Chinese Mathematics"},{"key":"150475_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0166-218X(84)90089-1","volume":"9","author":"M. Guan","year":"1984","unstructured":"M. Guan, \u201cOn the windy postman problem,\u201d Discrete Applied Mathematics, vol. 9, pp. 41-44, 1984.","journal-title":"Discrete Applied Mathematics"},{"key":"150475_CR13","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1137\/0606065","volume":"6","author":"M. Guan","year":"1985","unstructured":"M. Guan, and W. Pulleyblank, \u201cEulerian orientations and circulations,\u201d SIAM Journal on Algebra and Discrete Mathematics, vol. 6, pp. 657-664, 1985.","journal-title":"SIAM Journal on Algebra and Discrete Mathematics"},{"key":"150475_CR14","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/0305-0548(94)90083-3","volume":"21","author":"F. Harche","year":"1994","unstructured":"F. Harche and G.L. Thompson, \u201cThe column subtraction method: An exact algorithm for solving weighted set partitioning, covering and packing problems,\u201d Computers and Operations Research, vol. 21, pp. 423-435, 1994.","journal-title":"Computers and Operations Research"},{"key":"150475_CR15","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1137\/0204007","volume":"4","author":"D.B. Johnson","year":"1975","unstructured":"D.B. Johnson, \u201cFinding all the elementary circuits of a directed graph,\u201d SIAM Journal on Computing, vol. 4, pp. 77-84, 1975.","journal-title":"SIAM Journal on Computing"},{"key":"150475_CR16","volume-title":"Optimization Algorithms for Networks and Graphs","author":"E. Minieka","year":"1978","unstructured":"E. Minieka, Optimization Algorithms for Networks and Graphs, Marcel Dekker: New York, 1978."},{"key":"150475_CR17","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1287\/mnsc.25.7.643","volume":"25","author":"E. Minieka","year":"1979","unstructured":"E. Minieka, \u201cThe Chinese postman problem for mixed networks,\u201d Management Science, vol. 25, pp. 643-646, 1979.","journal-title":"Management Science"},{"key":"150475_CR18","first-page":"357","volume":"5","author":"C.S. Orloff","year":"1974","unstructured":"C.S. Orloff, \u201cA fundamental problem in vehicle routing,\u201d Networks, vol. 5, pp. 357-370, 1974.","journal-title":"Networks"},{"key":"150475_CR19","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1145\/321958.321974","volume":"23","author":"C. Papadimitriou","year":"1976","unstructured":"C. Papadimitriou, \u201cOn the complexity of edge traversing,\u201d Journal of the Association of Computing Machinery, vol. 23, pp. 544-554, 1976.","journal-title":"Journal of the Association of Computing Machinery"},{"key":"150475_CR20","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF02592222","volume":"29","author":"A.P. Sethi","year":"1984","unstructured":"A.P. Sethi and G.L. Thompson, \u201cThe pivot and probe algorithm for solving a linear program,\u201d Mathematical Programming, vol. 29, pp. 219-233, 1984.","journal-title":"Mathematical Programming"},{"unstructured":"Z. Win, \u201cContributions to Routing Problems,\u201d Doctoral Dissertation, Universitat Augsburg, 1987.","key":"150475_CR21"},{"key":"150475_CR22","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01587080","volume":"44","author":"Z. Win","year":"1989","unstructured":"Z. Win, \u201cOn the windy postman problem on Eulerian graphs,\u201d Mathematical Programming, vol. 44, pp. 97- 112, 1989.","journal-title":"Mathematical Programming"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018350224084.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1018350224084\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018350224084.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:06:24Z","timestamp":1752375984000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1018350224084"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["150475"],"URL":"https:\/\/doi.org\/10.1023\/a:1018350224084","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}