{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T10:52:22Z","timestamp":1750071142743,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030589417"},{"type":"electronic","value":"9783030589424"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58942-4_18","type":"book-chapter","created":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T06:03:58Z","timestamp":1600409038000},"page":"273-282","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Minimum Cycle Partition with Length Requirements"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9184-8215","authenticated-orcid":false,"given":"Kai","family":"Hoppmann","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0964-9802","authenticated-orcid":false,"given":"Gioni","family":"Mexi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1836-4200","authenticated-orcid":false,"given":"Oleg","family":"Burdakov","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2741-468X","authenticated-orcid":false,"given":"Carl Johan","family":"Casselgren","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1967-0077","authenticated-orcid":false,"given":"Thorsten","family":"Koch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,19]]},"reference":[{"issue":"1","key":"18_CR1","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.disopt.2006.10.006","volume":"4","author":"T Achterberg","year":"2007","unstructured":"Achterberg, T.: Conflict analysis in mixed integer programming. Disc. Optim. 4(1), 4\u201320 (2007)","journal-title":"Disc. Optim."},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Asghar, A.B., Smith, S.L., Sundaram, S.: Multi-Robot Routing for Persistent Monitoring with Latency Constraints. arXiv preprint \narXiv:1903.06105\n\n (2019)","DOI":"10.23919\/ACC.2019.8814485"},{"issue":"1\u20133","key":"18_CR3","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1016\/j.tcs.2008.05.010","volume":"407","author":"F Cazals","year":"2008","unstructured":"Cazals, F., Karande, C.: A note on the problem of reporting maximal cliques. Theor. Comput. Sci. 407(1\u20133), 564\u2013568 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR4","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-319-07596-9_8","volume-title":"Ambient Intelligence - Software and Applications","author":"P Chamoso","year":"2014","unstructured":"Chamoso, P., Raveane, W., Parra, V., Gonz\u00e1lez, A.: UAVs applied to the counting and monitoring of animals. In: Ramos, C., Novais, P., Nihan, C.E., Corchado Rodr\u00edguez, J.M. (eds.) Ambient Intelligence - Software and Applications. AISC, vol. 291, pp. 71\u201380. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-07596-9_8"},{"key":"18_CR5","unstructured":"Desroches, M., Lenstra, J., Savelbergh, M., Soumis, F.: Vehicle routing with time windows: optimization and approximation. In: Golden B.L., Assad, A.A. (eds.) Vehicle routing: Methods and Studies, North-Holland, Amsterdam, pp. 65\u201384 (1988)"},{"key":"18_CR6","unstructured":"Drucker, N., Penn, M., Strichman, O.: Cyclic routing of unmanned air vehicles. Information Systems Engineering Technical Reports. IE\/IS-2014-02 (2014)"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.jcss.2019.02.002","volume":"103","author":"N Drucker","year":"2019","unstructured":"Drucker, N., Ho, H.M., Ouaknine, J., Penn, M., Strichman, O.: Cyclic-routing of unmanned aerial vehicles. J. Comput. Syst. Sci. 103, 18\u201345 (2019)","journal-title":"J. Comput. Syst. Sci."},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-319-33954-2_10","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"N Drucker","year":"2016","unstructured":"Drucker, N., Penn, M., Strichman, O.: Cyclic routing of unmanned aerial vehicles. In: Quimper, C.-G. (ed.) CPAIOR 2016. LNCS, vol. 9676, pp. 125\u2013141. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-33954-2_10"},{"key":"18_CR9","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, vol. 29. W.H, Freeman New York (2002)"},{"key":"18_CR10","unstructured":"Gurobi Optimization, L.: Gurobi Optimizer Reference Manual, Version 9.0.0 (2019). \nhttp:\/\/www.gurobi.com"},{"key":"18_CR11","unstructured":"Hausamann, D., Zirnig, W., Schreier, G.: Monitoring of gas transmission pipelines - a customer driven civil UAV application. In: ODAS Conference (2003)"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-662-46678-0_21","volume-title":"Foundations of Software Science and Computation Structures","author":"H-M Ho","year":"2015","unstructured":"Ho, H.-M., Ouaknine, J.: The cyclic-routing UAV problem is PSPACE-complete. In: Pitts, A. (ed.) FoSSaCS 2015. LNCS, vol. 9034, pp. 328\u2013342. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-662-46678-0_21"},{"issue":"5","key":"18_CR13","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"JP Marques-Silva","year":"1999","unstructured":"Marques-Silva, J.P., Sakallah, K.A.: GRASP: a search algorithm for propositional satisfiability. IEEE Trans. Comput. 48(5), 506\u2013521 (1999)","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"18_CR14","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"CE Miller","year":"1960","unstructured":"Miller, C.E., Tucker, A.W., Zemlin, R.A.: Integer programming formulation of traveling salesman problems. J. ACM (JACM) 7(4), 326\u2013329 (1960)","journal-title":"J. ACM (JACM)"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Ollero, A., Mart\u00ednez de Dios, J.R., Merino, L.: Unmanned aerial vehicles as tools for forest-fire fighting. Forest Ecol. Manage. 234(1), S263 (2006)","DOI":"10.1016\/j.foreco.2006.08.292"},{"issue":"4","key":"18_CR16","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB - A Traveling Salesman Problem Library. ORSA Journal on Computing 3(4), 267\u2013384 (1991)","journal-title":"ORSA Journal on Computing"},{"issue":"3","key":"18_CR17","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1137\/0206041","volume":"6","author":"DJ Rosenkrantz","year":"1977","unstructured":"Rosenkrantz, D.J., Stearns, R.E., Lewis II, P.M.: An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput. 6(3), 563\u2013581 (1977)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"18_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.22.1.1","volume":"22","author":"MM Solomon","year":"1988","unstructured":"Solomon, M.M., Desrosiers, J.: Survey paper - time Window constrained routing and scheduling problems. Transp. Sci. 22(1), 1\u201313 (1988)","journal-title":"Transp. Sci."},{"key":"18_CR19","doi-asserted-by":"publisher","unstructured":"Witzig, J., Berthold, T., Heinz, S.: Experiments with conflict analysis in mixed integer programming. In: International Conference on AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pp. 211\u2013220. Springer (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-59776-8_17","DOI":"10.1007\/978-3-319-59776-8_17"},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.tcs.2019.04.009","volume":"793","author":"W Yu","year":"2019","unstructured":"Yu, W., Liu, Z., Bao, X.: New approximation algorithms for the minimum cycle cover problem. Theor. Comput. Sci. 793, 44\u201358 (2019)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR21","unstructured":"Zhang, L., Madigan, C.F., Moskewicz, M.H., Malik, S.: Efficient conflict driven learning in a boolean satisfiability solver. In: IEEE\/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE\/ACM Digest of Technical Papers (Cat. No. 01CH37281), pp. 279\u2013285. IEEE (2001)"}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58942-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T06:09:40Z","timestamp":1600409380000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58942-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030589417","9783030589424"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58942-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"19 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cpaior2020.dbai.tuwien.ac.at\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.08","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.08","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}