{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T22:31:49Z","timestamp":1762900309727,"version":"3.37.3"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,6,21]],"date-time":"2022-06-21T00:00:00Z","timestamp":1655769600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,21]],"date-time":"2022-06-21T00:00:00Z","timestamp":1655769600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100014440","name":"Ministerio de Ciencia, Innovaci\u00f3n y Universidades","doi-asserted-by":"publisher","award":["PGC2018-099428-B-I00"],"award-info":[{"award-number":["PGC2018-099428-B-I00"]}],"id":[{"id":"10.13039\/100014440","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s10589-022-00383-x","type":"journal-article","created":{"date-parts":[[2022,6,21]],"date-time":"2022-06-21T19:39:42Z","timestamp":1655840382000},"page":"67-109","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Polyhedral analysis and a new algorithm for the length constrained K\u2013drones rural postman problem"],"prefix":"10.1007","volume":"83","author":[{"given":"James","family":"Campbell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c1ngel","family":"Corber\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Isaac","family":"Plana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0039-8122","authenticated-orcid":false,"given":"Jos\u00e9 M.","family":"Sanchis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paula","family":"Segura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,21]]},"reference":[{"key":"383_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105445","author":"L Amorosi","year":"2021","unstructured":"Amorosi, L., Puerto, J., Valverde, C.: Coordinating drones with mothership vehicles: the mothership and drone routing problem with graphs. Comput. Operations Res. (2021). https:\/\/doi.org\/10.1016\/j.cor.2021.105445","journal-title":"Comput. Operations Res."},{"key":"383_CR2","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/0095-8956(86)90063-8","volume":"40","author":"F Barahona","year":"1986","unstructured":"Barahona, F., Gr\u00f8\"=\u00f6tschel, M.: On the cycle polytope of a binary matroid. J. Comb. Theory B 40, 40\u201362 (1986)","journal-title":"J. Comb. Theory B"},{"key":"383_CR3","volume-title":"Arc Routing: Theory, Solutions and Applications","author":"E Benavent","year":"2000","unstructured":"Benavent, E., Corber\u00e1n, \u00c1., Sanchis, J.M.: Linear Programming based methods for solving arc routing problems. In: Dror, M. (ed.) Arc Routing: Theory, Solutions and Applications. Kluwer Academic Publishers, Alphen aan den Rijn (2000)"},{"key":"383_CR4","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1002\/net.21858","volume":"72","author":"JF Campbell","year":"2018","unstructured":"Campbell, J.F., Corber\u00e1n, \u00c1., Plana, I., Sanchis, J.M.: Drone arc routing problems. Networks 72, 543\u2013559 (2018)","journal-title":"Networks"},{"key":"383_CR5","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.ejor.2020.10.035","volume":"292","author":"JF Campbell","year":"2021","unstructured":"Campbell, J.F., Corber\u00e1n, \u00c1., Plana, I., Sanchis, J.M., Segura, P.: Solving the length constrained K-drones rural postman problem. Eur. J. Operation. Res. 292, 60\u201372 (2021)","journal-title":"Eur. J. Operation. Res."},{"key":"383_CR6","unstructured":"Chapa, S.: \u201cRailroad Commission launches drone fleet for inspections\u201d, Houston Chronicle, May 12 (2020). https:\/\/www.houstonchronicle.com\/business\/energy\/article\/Railroad-Commission-launches-drone-fleet-for-15264009.php"},{"key":"383_CR7","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1002\/net.21965","volume":"77","author":"\u00c1 Corber\u00e1n","year":"2021","unstructured":"Corber\u00e1n, \u00c1., Eglese, R., Hasle, G., Plana, I., Sanchis, J.M.: Arc routing problems: a review of the past, present, and future. Networks 77, 88\u2013115 (2021)","journal-title":"Networks"},{"volume-title":"Arc Routing: Problems, Methods, and Applications","year":"2014","key":"383_CR8","unstructured":"Corber\u00e1n, \u00c1., Laporte, G. (eds.): Arc Routing: Problems, Methods, and Applications. MOS-SIAM Series on Optimization, SIAM, Philadelphia (2014)"},{"key":"383_CR9","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/PL00011426","volume":"90","author":"\u00c1 Corber\u00e1n","year":"2001","unstructured":"Corber\u00e1n, \u00c1., Letchford, A.N., Sanchis, J.M.: A Cutting-plane Algorithm for the General Routing Problem. Math. Program. 90, 291\u2013316 (2001)","journal-title":"Math. Program."},{"key":"383_CR10","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10107-011-0507-6","volume":"141","author":"\u00c1 Corber\u00e1n","year":"2013","unstructured":"Corber\u00e1n, \u00c1., Plana, I., Rodr\u00edguez-Ch\u00eda, A.M., Sanchis, J.M.: A branch-and-cut algorithm for the maximum benefit Chinese postman problem. Math. Program. 141, 21\u201348 (2013)","journal-title":"Math. Program."},{"key":"383_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.: A branch & cut algorithm for the windy general routing problem and special cases. Networks 49, 245\u2013257 (2007)","journal-title":"Networks"},{"key":"383_CR12","doi-asserted-by":"publisher","unstructured":"Corber\u00e1n, \u00c1., Plana, I., Sanchis, J.M., Segura, P.: \u201cPolyhedral study of a new formulation for the Rural Postman Problem\u201d, Internal Report. https:\/\/doi.org\/10.13140\/RG.2.2.36748.85122\/1.(2021). Available at http:\/\/www.uv.es\/corberan\/reports.htm","DOI":"10.13140\/RG.2.2.36748.85122\/1."},{"key":"383_CR13","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s10107-003-0391-9","volume":"96","author":"\u00c1 Corber\u00e1n","year":"2003","unstructured":"Corber\u00e1n, \u00c1., Romero, A., Sanchis, J.M.: The mixed general routing polyhedron. Math. Program. 96, 103\u2013137 (2003)","journal-title":"Math. Program."},{"key":"383_CR14","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.: A polyhedral approach to the rural postman problem. Eur. J. Operation. Res. 79, 95\u2013114 (1994)","journal-title":"Eur. J. Operation. Res."},{"key":"383_CR15","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1016\/S0377-2217(96)00337-2","volume":"108","author":"\u00c1 Corber\u00e1n","year":"1998","unstructured":"Corber\u00e1n, \u00c1., Sanchis, J.M.: The general routing problem polyhedron: facets from the RPP and GTSP polyhedra. Eur. J. Operation. Res. 108, 538\u2013550 (1998)","journal-title":"Eur. J. Operation. Res."},{"issue":"8","key":"383_CR16","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.ifacol.2019.08.049","volume":"52","author":"P Durdevic","year":"2019","unstructured":"Durdevic, P., Ortiz-Arroyo, D., Li, S., Yang, Z.: Vision aided navigation of a quad-rotor for autonomous wind-farm inspection. IFAC-PapersOnLine 52(8), 61\u201366 (2019)","journal-title":"IFAC-PapersOnLine"},{"key":"383_CR17","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1002\/(SICI)1097-0037(199910)34:3<173::AID-NET1>3.0.CO;2-W","volume":"34","author":"RS Garfinkel","year":"1999","unstructured":"Garfinkel, R.S., Webb, I.R.: On crossings, the crossing postman problem, and the rural postman problem. Networks 34, 173\u2013180 (1999)","journal-title":"Networks"},{"key":"383_CR18","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s101070050007","volume":"87","author":"G Ghiani","year":"2000","unstructured":"Ghiani, G., Laporte, G.: A branch-and-cut algorithm for the Undirected Rural Postman Problem. Math. Program. 87, 467\u2013481 (2000)","journal-title":"Math. Program."},{"key":"383_CR19","first-page":"18","volume":"74","author":"T Graetz","year":"2018","unstructured":"Graetz, T., Lo, S.: How BNSF is leading the way for DRONE use in rail: an interview with Todd Graetz director TS, telecomm, technology services, BNSF. Def. Transp. J. 74, 18\u201323 (2018)","journal-title":"Def. Transp. J."},{"key":"383_CR20","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/BF01442866","volume":"6","author":"C Hierholzer","year":"1873","unstructured":"Hierholzer, C.: \u00dcber die M\u00f6glichkeit, einen Linienzug ohne Wiederholung und ohne Unterbrechung zu umfahren. Mathematische Annalen 6, 30\u201332 (1873)","journal-title":"Mathematische Annalen"},{"key":"383_CR21","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1016\/j.scitotenv.2019.02.310","volume":"668","author":"D Jones","year":"2019","unstructured":"Jones, D., Gates, A., Huvenne, V., Phillips, A., Bett, B.: Autonomous marine environmental monitoring: application in decommissioned oil fields. Sci. Total Environ. 668, 835\u2013853 (2019)","journal-title":"Sci. Total Environ."},{"key":"383_CR22","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1049\/iet-rsn.2017.0251","volume":"12","author":"S Jordan","year":"2018","unstructured":"Jordan, S., Moore, J., Hovet, S., Box, J., Perry, J., Kirsche, K., Lewis, D.D., Tse, Z.: State-of-the-art technologies for UAV inspections. IET Radar Sonar Navig 12, 151\u2013164 (2018)","journal-title":"IET Radar Sonar Navig"},{"key":"383_CR23","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/s10846-018-0954-x","volume":"95","author":"M Karaduman","year":"2019","unstructured":"Karaduman, M., \u00c7inar, A., Eren, H.: UAV traffic patrolling via road detection and tracking in anonymous aerial video frames. J. Intell. Robot Syst. 95, 675\u2013690 (2019)","journal-title":"J. Intell. Robot Syst."},{"key":"383_CR24","unstructured":"Knight, R.: \u201cUAV Inspection At The Biggest Oil Rig In The World\u201d. December 2, 2019. https:\/\/www.microdrones.com\/en\/content\/uav-inspection-at-the-biggest-oil-rig-in-the-world\/"},{"key":"383_CR25","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.: Odd minimum cut-sets and b-matchings revisited. SIAM J. Discr. Math. 22, 1480\u20131487 (2008)","journal-title":"SIAM J. Discr. Math."},{"key":"383_CR26","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.cie.2018.05.039","volume":"122","author":"M Li","year":"2018","unstructured":"Li, M., Zhen, L., Wang, S., Lu, W., Qu, X.: Unmanned aerial vehicle scheduling problem for traffic monitoring. Comput. Ind. Eng. 122, 15\u201323 (2018)","journal-title":"Comput. Ind. Eng."},{"key":"383_CR27","doi-asserted-by":"publisher","first-page":"1385","DOI":"10.3390\/en12071385","volume":"12","author":"Y Liu","year":"2019","unstructured":"Liu, Y., Shi, J., Liu, Z., Huang, J., Zhou, T.: Two-layer routing for high-voltage powerline inspection by cooperated ground vehicle and drone. Energies 12, 1385 (2019)","journal-title":"Energies"},{"key":"383_CR28","doi-asserted-by":"publisher","first-page":"5164","DOI":"10.3390\/s19235164","volume":"19","author":"H Luo","year":"2019","unstructured":"Luo, H., Zhang, P., Wang, J., Wang, G., Meng, F.: Traffic patrolling routing problem with drones in an urban road system. Sensors 19, 5164 (2019)","journal-title":"Sensors"},{"key":"383_CR29","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.conengprac.2018.03.002","volume":"74","author":"S Mansouri","year":"2018","unstructured":"Mansouri, S., Kanellakis, C., Fresk, E., Komuiniak, D., Nikolakopoulos, G.: Cooperative coverage path planning for visual inspection. Control Eng. Pract. 74, 118\u2013131 (2018)","journal-title":"Control Eng. Pract."},{"key":"383_CR30","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1002\/net.21762","volume":"70","author":"MC Mour\u00e3o","year":"2017","unstructured":"Mour\u00e3o, M.C., Pinto, L.: An updated annotated bibliography on arc routing problems. Networks 70, 144\u2013194 (2017)","journal-title":"Networks"},{"key":"383_CR31","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.trb.2020.09.006","volume":"141","author":"F Outay","year":"2020","unstructured":"Outay, F., Mengash, H.A., Adnan, M.: Applications of unmanned aerial vehicle (UAV) in road safety, traffic and highway infrastructure management: recent advances and challenges. Transp. Res. Part A 141, 116\u2013129 (2020)","journal-title":"Transp. Res. Part A"},{"key":"383_CR32","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. Operations Res. 7, 67\u201380 (1982)","journal-title":"Math. Operations Res."},{"key":"383_CR33","unstructured":"Plotnikov, M., Ni, D., Price, D.: \u201cThe Application of Unmanned Aerial Systems In Surface Transportation - Volume II-A: development of a Pilot Program to Integrate UAS Technology to Bridge and Rail Inspections\u201d, Massachusetts Department of Transportation Report 19-010 (2019)"},{"key":"383_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2021.06.061","author":"J Puerto","year":"2021","unstructured":"Puerto, J., Valverde, C.: Routing for unmanned aerial vehicles: touring dimensional sets. Eur. J. Operation. Res. (2021). https:\/\/doi.org\/10.1016\/j.ejor.2021.06.061","journal-title":"Eur. J. Operation. Res."},{"key":"383_CR35","unstructured":"Rauhakallio, P.: \u201cThe Past, Present, and Future of Powerline Inspection Automation\u201d, POWER, (2020). https:\/\/www.powermag.com\/the-past-present-and-future-of-powerline-inspection-automation\/"},{"key":"383_CR36","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s10107-005-0640-1","volume":"106","author":"G Reinelt","year":"2006","unstructured":"Reinelt, G., Theis, D.: A note on the undirected rural postman problem polytope. Math. Program. 106, 447\u2013452 (2006)","journal-title":"Math. Program."},{"key":"383_CR37","doi-asserted-by":"publisher","first-page":"26","DOI":"10.3390\/robotics10010026","volume":"10","author":"M Shafiee","year":"2021","unstructured":"Shafiee, M., Zhou, Z., Mei, L., Dinmohammadi, F., Karama, J., Flynn, D.: Unmanned aerial drones for inspection of offshore wind turbines: a mission-critical failure analysis. Robotics 10, 26 (2021). https:\/\/doi.org\/10.3390\/robotics10010026","journal-title":"Robotics"},{"key":"383_CR38","unstructured":"Sherrock, E., Neubecker, K.: \u201cUnmanned Aircraft System Applications in International Railroads\u201d, United States Department of Transportation Report DOT\/FRA\/ORD-18\/04, Final Report, February 2018 (2018)"},{"key":"383_CR39","unstructured":"United Nations ESCAP (Economic and Social Commission for Asia and the Pacific), Working Group on the Trans-Asian Railway Network, (2019). Inspection and monitoring of railway infrastructure using aerial drones. Note by the secretariat, ESCAP\/TARN\/WG\/2019\/4"},{"key":"383_CR40","unstructured":"Wishart, J., Lennertz, T., Hasson, D.: \u201cUse Cases for Unmanned Aircraft Systems (UAS) in Public Transportation Systems\u201d, Federal Transit Administration FTA Report No. 0176, John A. Volpe National Transportation Systems Center, December 2020 (2020)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00383-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-022-00383-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00383-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,5]],"date-time":"2022-08-05T06:16:24Z","timestamp":1659680184000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-022-00383-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,21]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["383"],"URL":"https:\/\/doi.org\/10.1007\/s10589-022-00383-x","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2022,6,21]]},"assertion":[{"value":"28 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 June 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}