{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T19:30:56Z","timestamp":1751484656621},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T00:00:00Z","timestamp":1553644800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s12532-019-00155-5","type":"journal-article","created":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T21:05:16Z","timestamp":1553720716000},"page":"587-629","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["OAR Lib: an open source arc routing library"],"prefix":"10.1007","volume":"11","author":[{"given":"Oliver","family":"Lum","sequence":"first","affiliation":[]},{"given":"Bruce","family":"Golden","sequence":"additional","affiliation":[]},{"given":"Edward","family":"Wasil","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,3,27]]},"reference":[{"key":"155_CR1","unstructured":"Arc Routing Problems: Data Instances. http:\/\/www.uv.es\/corberan\/instancias.htm"},{"key":"155_CR2","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/3-540-45749-6_10","volume-title":"Algorithms-ESA 2002","author":"D Ahr","year":"2002","unstructured":"Ahr, D., Reinelt, G.: New heuristics and lower bounds for the min-max k-Chinese postman problem. Algorithms-ESA 2002, pp. 64\u201374. Springer, Berlin (2002)"},{"key":"155_CR3","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1609\/icwsm.v3i1.13937","volume":"8","author":"M Bastian","year":"2009","unstructured":"Bastian, M., Heymann, S., Jacomy, M.: Gephi: an open source software for exploring and manipulating networks. ICWSM 8, 361\u2013362 (2009)","journal-title":"ICWSM"},{"issue":"12","key":"155_CR4","doi-asserted-by":"publisher","first-page":"3111","DOI":"10.1016\/j.cor.2004.04.007","volume":"32","author":"E Benavent","year":"2005","unstructured":"Benavent, E., Corber\u00e1n, A., Pi\u00f1ana, E., Plana, I., Sanchis, J.M.: New heuristic algorithms for the windy rural postman problem. Comput. Oper. Res. 32(12), 3111\u20133128 (2005)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"155_CR5","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BF01299159","volume":"4","author":"V Campos","year":"1995","unstructured":"Campos, V., Savall, J.V.: A computational study of several heuristics for the DRPP. Comput. Optim. Appl. 4(1), 67\u201377 (1995)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"155_CR6","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1002\/net.21748","volume":"70","author":"A Corber\u00e1n","year":"2017","unstructured":"Corber\u00e1n, A., Golden, B., Lum, O., Plana, I., Sanchis, J.: Aesthetic considerations for the min-max k windy rural postman problem. Networks 70(3), 216\u2013232 (2017)","journal-title":"Networks"},{"key":"155_CR7","volume-title":"Optimization and Operations Research","author":"U Derigs","year":"2009","unstructured":"Derigs, U.: Optimization and Operations Research. Eolss Publishers Company Limited, New York (2009)"},{"issue":"1","key":"155_CR8","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"issue":"4","key":"155_CR9","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1016\/j.cor.2012.10.013","volume":"40","author":"B Dussault","year":"2013","unstructured":"Dussault, B., Golden, B., Gro\u00ebr, C., Wasil, E.: Plowing with precedence: a variant of the windy postman problem. Comput. Oper. Res. 40(4), 1047\u20131059 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"155_CR10","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/BF01580113","volume":"5","author":"J Edmonds","year":"1973","unstructured":"Edmonds, J., Johnson, E.L.: Matching, Euler tours and the Chinese postman. Math. Program. 5(1), 88\u2013124 (1973)","journal-title":"Math. Program."},{"issue":"2","key":"155_CR11","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1287\/opre.43.2.231","volume":"43","author":"HA Eiselt","year":"1995","unstructured":"Eiselt, H.A., Gendreau, M., Laporte, G.: Arc routing problems, part I: the Chinese postman problem. Oper. Res. 43(2), 231\u2013242 (1995)","journal-title":"Oper. Res."},{"issue":"3","key":"155_CR12","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1287\/opre.43.3.399","volume":"43","author":"HA Eiselt","year":"1995","unstructured":"Eiselt, H.A., Gendreau, M., Laporte, G.: Arc routing problems, part II: the rural postman problem. Oper. Res. 43(3), 399\u2013414 (1995)","journal-title":"Oper. Res."},{"issue":"6","key":"155_CR13","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"RW Floyd","year":"1962","unstructured":"Floyd, R.W.: Algorithm 97: shortest path. Commun. ACM 5(6), 345 (1962)","journal-title":"Commun. ACM"},{"issue":"3","key":"155_CR14","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1145\/322139.322150","volume":"26","author":"GN Frederickson","year":"1979","unstructured":"Frederickson, G.N.: Approximation algorithms for some postman problems. J. ACM 26(3), 538\u2013554 (1979)","journal-title":"J. ACM"},{"key":"155_CR15","unstructured":"GNU Trove library. http:\/\/trove.starlight-systems.com\/"},{"issue":"2","key":"155_CR16","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s12532-010-0013-5","volume":"2","author":"C Gro\u00ebr","year":"2010","unstructured":"Gro\u00ebr, C., Golden, B., Wasil, E.: A library of local search heuristics for the vehicle routing problem. Math. Program. Comput. 2(2), 79\u2013101 (2010)","journal-title":"Math. Program. Comput."},{"issue":"1\u20133","key":"155_CR17","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/BF01581206","volume":"55","author":"M Gr\u00f6tschel","year":"1992","unstructured":"Gr\u00f6tschel, M., Win, Z.: A cutting plane algorithm for the windy postman problem. Math. Program. 55(1\u20133), 339\u2013358 (1992)","journal-title":"Math. Program."},{"issue":"4","key":"155_CR18","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1109\/MPRV.2008.80","volume":"7","author":"M Haklay","year":"2008","unstructured":"Haklay, M., Weber, P.: Openstreetmap: user-generated street maps. IEEE Pervasive Comput. 7(4), 12\u201318 (2008)","journal-title":"IEEE Pervasive Comput."},{"issue":"1","key":"155_CR19","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/BF01442866","volume":"6","author":"C Hierholzer","year":"1873","unstructured":"Hierholzer, C., Wiener, C.: \u00dcber die M\u00f6glichkeit, einen Linienzug ohne Wiederholung und ohne Unterbrechung zu umfahren. Math. Ann. 6(1), 30\u201332 (1873)","journal-title":"Math. Ann."},{"issue":"1","key":"155_CR20","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20(1), 359\u2013392 (1998)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"155_CR21","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s12532-009-0002-8","volume":"1","author":"V Kolmogorov","year":"2009","unstructured":"Kolmogorov, V., Blossom, V.: A new implementation of a minimum cost perfect matching algorithm. Math. Program. Comput. 1(1), 43\u201367 (2009)","journal-title":"Math. Program. Comput."},{"key":"155_CR22","volume-title":"A Java Library of Graph Algorithms and Optimization","author":"HT Lau","year":"2010","unstructured":"Lau, H.T.: A Java Library of Graph Algorithms and Optimization. CRC Press, London (2010)"},{"key":"155_CR23","doi-asserted-by":"crossref","unstructured":"Letchford, A.N., Reinelt, G., Theis, D.O.: A faster exact separation algorithm for blossom inequalities. In: Integer Programming and Combinatorial Optimization, pp. 196\u2013205. Springer, Berlin (2004)","DOI":"10.1007\/978-3-540-25960-2_15"},{"issue":"3","key":"155_CR24","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1002\/net.21730","volume":"69","author":"O Lum","year":"2016","unstructured":"Lum, O., Cerrone, C., Golden, B., Wasil, E.: Partitioning a street network into compact, balanced, and visually appealing routes. Networks 69(3), 290\u2013303 (2016)","journal-title":"Networks"},{"key":"155_CR25","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.cor.2017.07.007","volume":"88","author":"O Lum","year":"2017","unstructured":"Lum, O., Zhang, R., Golden, B., Wasil, E.: A hybrid heuristic for the windy rural postman problem with time-dependent zigzag options. Comput. Oper. Res. 88, 247\u2013257 (2017)","journal-title":"Comput. Oper. Res."},{"key":"155_CR26","unstructured":"Minimum cost flow tutorial. http:\/\/community.topcoder.com\/tc?module=Static&d1=tutorials&d2=minimumCostFlow2"},{"issue":"1","key":"155_CR27","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1287\/moor.7.1.67","volume":"7","author":"MW Padberg","year":"1982","unstructured":"Padberg, M.W., Rao, M.R.: Odd minimum cut-sets and b-matchings. Math. Oper. Res. 7(1), 67\u201380 (1982)","journal-title":"Math. Oper. Res."},{"issue":"6","key":"155_CR28","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36(6), 1389\u20131401 (1957)","journal-title":"Bell Syst. Tech. J."},{"key":"155_CR29","volume-title":"JUnit in Action","author":"P Tahchiev","year":"2010","unstructured":"Tahchiev, P., Leme, F., Massol, V., Gregory, G.: JUnit in Action. Manning Publications Co, New York (2010)"},{"issue":"11","key":"155_CR30","doi-asserted-by":"publisher","first-page":"1081","DOI":"10.1002\/spe.540","volume":"33","author":"H Thimbleby","year":"2003","unstructured":"Thimbleby, H.: The directed Chinese postman problem. Softw. Pract. Exp. 33(11), 1081\u20131096 (2003)","journal-title":"Softw. Pract. Exp."},{"issue":"1\u20133","key":"155_CR31","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01587080","volume":"44","author":"Z Win","year":"1989","unstructured":"Win, Z.: On the windy postman problem on Eulerian graphs. Math. Program. 44(1\u20133), 97\u2013112 (1989)","journal-title":"Math. Program."},{"issue":"2","key":"155_CR32","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1023\/A:1020915403051","volume":"3","author":"K Yaoyuenyong","year":"2002","unstructured":"Yaoyuenyong, K., Charnsethikul, P., Chankong, V.: A heuristic algorithm for the mixed Chinese postman problem. Optim. Eng. 3(2), 157\u2013187 (2002)","journal-title":"Optim. Eng."}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-019-00155-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-019-00155-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-019-00155-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,14]],"date-time":"2023-09-14T23:06:14Z","timestamp":1694732774000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-019-00155-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,27]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["155"],"URL":"https:\/\/doi.org\/10.1007\/s12532-019-00155-5","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3,27]]},"assertion":[{"value":"24 July 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 February 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}