{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:33:30Z","timestamp":1740123210997,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2024,8,2]],"date-time":"2024-08-02T00:00:00Z","timestamp":1722556800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,2]],"date-time":"2024-08-02T00:00:00Z","timestamp":1722556800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s10479-024-06161-8","type":"journal-article","created":{"date-parts":[[2024,8,2]],"date-time":"2024-08-02T13:38:53Z","timestamp":1722605933000},"page":"993-1022","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A branch-and-cut algorithm for the windy profitable location rural postman problem"],"prefix":"10.1007","volume":"341","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8266-2715","authenticated-orcid":false,"given":"Mostafa","family":"Khorramizadeh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roghayeh","family":"Javvi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,2]]},"reference":[{"key":"6161_CR1","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-319-13111-5_15","volume-title":"Location science","author":"M Albareda-Sambola","year":"2015","unstructured":"Albareda-Sambola, M. (2015). Location-routing and location-arc routing. In G. Laporte, S. Nickel, & F. Saldanha da Gama (Eds.), Location science (pp. 399\u2013418). Springer."},{"issue":"1","key":"6161_CR2","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.orl.2005.12.009","volume":"35","author":"A Amaya","year":"2007","unstructured":"Amaya, A., Langevin, A., & Tr\u00e9panier, M. (2007). The capacitated arc routing with refill points. Operations Research Letters, 35(1), 45\u201353.","journal-title":"Operations Research Letters"},{"issue":"3","key":"6161_CR3","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1016\/j.ejor.2013.07.018","volume":"236","author":"C Arbib","year":"2014","unstructured":"Arbib, C., Servilio, M., Archetti, C., & Speranza, M. G. (2014). The directed profitable location rural postman problem. European Journal of Operational Research, 236(3), 811\u2013819.","journal-title":"European Journal of Operational Research"},{"key":"6161_CR4","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.cor.2015.08.003","volume":"66","author":"C Archetti","year":"2016","unstructured":"Archetti, C., Corber\u00e1n, \u00c1., Plana, I., Sanchis, J. M., & Speranza, M. G. (2016). A branch-and-cut algorithm for the orienteering arc routing problem. Computers and Operations Research, 66, 95\u2013104.","journal-title":"Computers and Operations Research"},{"issue":"3","key":"6161_CR5","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1287\/trsc.2013.0484","volume":"48","author":"C Archetti","year":"2014","unstructured":"Archetti, C., Speranza, M. G., Corber\u00e1n, \u00c1., Sanchis, J. M., & Plana, I. (2014). The team orienteering arc routing problem. Transportation Science, 48(3), 442\u2013457.","journal-title":"Transportation Science"},{"issue":"3","key":"6161_CR6","doi-asserted-by":"publisher","first-page":"1092","DOI":"10.1016\/j.ejor.2015.10.016","volume":"249","author":"T \u00c1vila","year":"2016","unstructured":"\u00c1vila, T., Corber\u00e1n, \u00c1., Plana, I., & Sanchis, J. M. (2016). A branch-and-cut algorithm for the profitable windy rural postman problem. European Journal of Operational Research, 249(3), 1092\u20131101.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"6161_CR7","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1016\/j.ejor.2005.09.021","volume":"176","author":"E Benavent","year":"2007","unstructured":"Benavent, E., Carrotta, A., Corber\u00e1n, \u00c1., Sanchis, J. M., & Vigo, D. (2007). Lower bounds and heuristics for the windy rural postman problem. European Journal of Operational Research, 176(2), 855\u2013869.","journal-title":"European Journal of Operational Research"},{"key":"6161_CR8","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BFb0121091","volume-title":"Netflow at Pisa. Mathematical Programming Studies","author":"N Christofides","year":"1986","unstructured":"Christofides, N., Campos, V., Corber\u00e1n, \u00c1., & Mota, E. (1986). An algorithm for the rural postman problem on a directed graph. In G. Gallo & C. Sandi (Eds.), Netflow at Pisa. Mathematical Programming Studies (Vol. 26, pp. 155\u2013166). Berlin: Springer."},{"doi-asserted-by":"crossref","unstructured":"Corber\u00e1n, \u00c1., & Laporte, G. (2014). Arc routing: Problems, methods, and applications. MOS-SIAM Series on optimization.","key":"6161_CR9","DOI":"10.1137\/1.9781611973679"},{"issue":"2","key":"6161_CR10","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1137\/050640886","volume":"22","author":"\u00c1 Corber\u00e1n","year":"2008","unstructured":"Corber\u00e1n, \u00c1., Plana, I., & Sanchis, J. M. (2008). The windy general routing polyhedron: A global view of many known arc routing polyhedra. SIAM Journal on Discrete Mathematics, 22(2), 606\u2013628.","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"4","key":"6161_CR11","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1002\/net.20176","volume":"49","author":"\u00c1 Corber\u00e1n","year":"2007","unstructured":"Corber\u00e1n, \u00c1., Plana, I., & Sanchis, J. M. (2007). A branch and cut algorithm for the windy general routing problem and special cases. Networks, 49(4), 245\u2013257.","journal-title":"Networks"},{"issue":"1","key":"6161_CR12","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0377-2217(94)90398-0","volume":"79","author":"\u00c1 Corber\u00e1n","year":"1994","unstructured":"Corber\u00e1n, \u00c1., & Sanchis, J. M. (1994). A polyhedral approach to the rural postman problem. European Journal of Operational Research, 79(1), 95\u2013114.","journal-title":"European Journal of Operational Research"},{"key":"6161_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4495-1","volume-title":"Arc routing: Theory, solutions and applications","author":"M Dror","year":"2000","unstructured":"Dror, M. (2000). Arc routing: Theory, solutions and applications. Springer."},{"issue":"5","key":"6161_CR14","doi-asserted-by":"publisher","first-page":"1213","DOI":"10.1287\/trsc.2018.0881","volume":"53","author":"E Fern\u00e1ndez","year":"2019","unstructured":"Fern\u00e1ndez, E., Laporte, G., & Rodriguez-Pereira, J. (2019). Exact solution of several families of location-arc routing problems. Transportation Science, 53(5), 1213\u20131499.","journal-title":"Transportation Science"},{"unstructured":"Ghiani, G. (1998). Arc routing, allocation-arc routing and location-arc routing problems. Unpublished doctoral dissertation, University of Naples Federico II, Naples, Italy.","key":"6161_CR15"},{"issue":"3","key":"6161_CR16","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1002\/net.3","volume":"37","author":"G Ghiani","year":"2001","unstructured":"Ghiani, G., Importa, G., & Laporte, G. (2001). The capacitated arc routing problem with intermediate facilities. Networks, 37(3), 134\u2013143.","journal-title":"Networks"},{"issue":"4","key":"6161_CR17","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/(SICI)1097-0037(199912)34:4<291::AID-NET9>3.0.CO;2-4","volume":"34","author":"G Ghiani","year":"1999","unstructured":"Ghiani, G., & Laporte, G. (1999). Eulerian location problems. Networks, 34(4), 291\u2013302.","journal-title":"Networks"},{"key":"6161_CR18","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF03399222","volume":"38","author":"G Ghiani","year":"2001","unstructured":"Ghiani, G., & Laporte, G. (2001). Location-arc routing problems. OPSEARCH, 38, 151\u2013159.","journal-title":"OPSEARCH"},{"issue":"17","key":"6161_CR19","doi-asserted-by":"publisher","first-page":"3238","DOI":"10.1016\/j.dam.2008.05.013","volume":"156","author":"H Glicksman","year":"2008","unstructured":"Glicksman, H., & Penn, M. (2008). Approximation algorithms for group prize-collecting and location-routing problems. Discrete Applied Mathematics, 156(17), 3238\u20133247.","journal-title":"Discrete Applied Mathematics"},{"key":"6161_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-77778-8","volume-title":"The vehicle routing problem: Latest advances and new challenges","author":"B Golden","year":"2008","unstructured":"Golden, B., Raghavan, S., & Wasil, E. (2008). The vehicle routing problem: Latest advances and new challenges. Springer."},{"issue":"1","key":"6161_CR21","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1287\/trsc.1120.0423","volume":"47","author":"T Harks","year":"2013","unstructured":"Harks, T., K\u00f6nig, F. G., & Matuschke, J. (2013). Approximation algorithms for capacitated location routing. Transportation Science, 47(1), 3\u201322.","journal-title":"Transportation Science"},{"issue":"1","key":"6161_CR22","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.ejor.2012.06.015","volume":"224","author":"SH Hashemi Doulabi","year":"2013","unstructured":"Hashemi Doulabi, S. H., & Seifi, A. (2013). Lower and upper bounds for location-arc routing problems with vehicle capacity constraints. European Journal of Operational Research, 224(1), 189\u2013208.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"6161_CR23","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1016\/j.ejor.2011.01.003","volume":"211","author":"I Karaoglan","year":"2011","unstructured":"Karaoglan, I., Altiparmak, F., Kara, I., & Dengiz, B. (2011). A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery. European Journal of Operational Research, 211(2), 318\u2013332.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"6161_CR24","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/j.omega.2011.09.002","volume":"40","author":"I Karaoglan","year":"2012","unstructured":"Karaoglan, I., Altiparmak, F., Kara, I., & Dengiz, B. (2012). The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach. Omega, 40(4), 465\u2013477.","journal-title":"Omega"},{"issue":"2","key":"6161_CR25","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0377-2217(96)00346-3","volume":"96","author":"AN Letchford","year":"1997","unstructured":"Letchford, A. N. (1997). New inequalities for the general routing problem. European Journal of Operational Research, 96(2), 317\u2013322.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"6161_CR26","doi-asserted-by":"publisher","first-page":"1480","DOI":"10.1137\/060664793","volume":"22","author":"AN Letchford","year":"2008","unstructured":"Letchford, A. N., Reinelt, G., & Theis, D. O. (2008). Odd minimum cut sets and b-matchings revisited. SIAM Journal on Discrete Mathematics, 22(4), 1480\u20131487.","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"6161_CR27","first-page":"74","volume":"27","author":"L Levy","year":"1989","unstructured":"Levy, L., & Bodin, L. (1989). The arc oriented location routing problem. INFOR: Information Systems and Operational Research, 27(1), 74\u201394.","journal-title":"INFOR: Information Systems and Operational Research"},{"key":"6161_CR28","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.cor.2013.10.003","volume":"43","author":"RB Lopes","year":"2014","unstructured":"Lopes, R. B., Plastria, F., Ferriera, C., & Santos, B. S. (2014). Location-arc routing problem: Heuristic approaches and test instances. Computers and Operations Research, 43, 309\u2013317.","journal-title":"Computers and Operations Research"},{"issue":"1","key":"6161_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(97)00172-0","volume":"108","author":"H Min","year":"1998","unstructured":"Min, H., Jayaraman, V., & Srivastava, R. (1998). Combined location-routing problems: A synthesis and future research directions. European Journal of Operational Research, 108(1), 1\u201315.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"6161_CR30","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1016\/j.ejor.2006.04.004","volume":"177","author":"G Nagy","year":"2007","unstructured":"Nagy, G., & Salhi, S. (2007). Location-routing: Issues, models and methods. European Journal of Operational Research, 177(2), 649\u2013672.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"6161_CR31","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. (1982). Odd minimum cut-sets and b-matchings. Mathematics of Operations Research, 7(1), 67\u201380.","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"6161_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2014.01.005","volume":"238","author":"C Prodhon","year":"2014","unstructured":"Prodhon, C., & Prins, C. (2014). A survey of recent research on location-routing problems. European Journal of Operational Research, 238(1), 1\u201317.","journal-title":"European Journal of Operational Research"},{"issue":"7","key":"6161_CR33","doi-asserted-by":"publisher","first-page":"1708","DOI":"10.1016\/j.cor.2013.01.007","volume":"40","author":"MA Salazar-Aguilara","year":"2013","unstructured":"Salazar-Aguilara, M. A., Langevin, A., & Laporte, G. (2013). The synchronized arc and node routing problem: Application to road marking. Computers and Operations Research, 40(7), 1708\u20131715.","journal-title":"Computers and Operations Research"},{"doi-asserted-by":"crossref","unstructured":"Toth, P., & Vigo, D. (2014). Vehicle Routing: Problems, methods, and applications (2nd ed.). MOS-SIAM Series on optimization.","key":"6161_CR34","DOI":"10.1137\/1.9781611973594"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-06161-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-024-06161-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-06161-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T15:08:11Z","timestamp":1729004891000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-024-06161-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,2]]},"references-count":34,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["6161"],"URL":"https:\/\/doi.org\/10.1007\/s10479-024-06161-8","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2024,8,2]]},"assertion":[{"value":"29 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 July 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval:"}}]}}