{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:12:41Z","timestamp":1771035161135,"version":"3.50.1"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030876715","type":"print"},{"value":"9783030876722","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-87672-2_25","type":"book-chapter","created":{"date-parts":[[2021,9,21]],"date-time":"2021-09-21T21:02:46Z","timestamp":1632258166000},"page":"377-392","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Exact Separation Algorithms for the Parallel Drone Scheduling Traveling Salesman Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4448-023X","authenticated-orcid":false,"given":"Tobias","family":"Klein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9649-4839","authenticated-orcid":false,"given":"Peter","family":"Becker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,22]]},"reference":[{"issue":"4","key":"25_CR1","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1287\/trsc.2017.0791","volume":"52","author":"N Agatz","year":"2018","unstructured":"Agatz, N., Bouman, P., Schmidt, M.: Optimization approaches for the traveling salesman problem with drone. Transp. Sci. 52(4), 965\u2013981 (2018). https:\/\/doi.org\/10.1287\/trsc.2017.0791","journal-title":"Transp. Sci."},{"key":"25_CR2","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T., Orlin, J.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"25_CR3","unstructured":"Ar\u00e1oz, J., Fern\u00e1ndez, E., Meza, O.: A simple exact separation algorithm for 2-matching inequalities (2007). http:\/\/www.optimization-online.org\/DB_FILE\/2007\/11\/1827.pdf"},{"issue":"6","key":"25_CR4","doi-asserted-by":"publisher","first-page":"1147","DOI":"10.1287\/opre.1070.0432","volume":"55","author":"R Baldacci","year":"2007","unstructured":"Baldacci, R., Dell\u2019Amico, M., Gonz\u00e1lez, J.S.: The capacitated m -ring-star problem. Oper. Res. 55(6), 1147\u20131162 (2007). https:\/\/doi.org\/10.1287\/opre.1070.0432","journal-title":"Oper. Res."},{"issue":"5","key":"25_CR5","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1287\/mnsc.26.5.495","volume":"26","author":"H Crowder","year":"1980","unstructured":"Crowder, H., Padberg, M.: Solving large-scale symmetric travelling salesman problems to optimality. Manage. Sci. 26(5), 495\u2013509 (1980). https:\/\/doi.org\/10.1287\/mnsc.26.5.495","journal-title":"Manage. Sci."},{"issue":"2","key":"25_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s10479-020-03562-3","volume":"289","author":"M Dell\u2019Amico","year":"2020","unstructured":"Dell\u2019Amico, M., Montemanni, R., Novellani, S.: Matheuristic algorithms for the parallel drone scheduling traveling salesman problem. Ann. Oper. Res. 289(2), 211\u2013226 (2020). https:\/\/doi.org\/10.1007\/s10479-020-03562-3","journal-title":"Ann. Oper. Res."},{"key":"25_CR7","unstructured":"Deutsche Post DHL Group: Schnelle Hilfe aus der Luft: Medikamentenversorgung mit Paketdrohne in Ostafrika erfolgreich erprobt, 04 Oct 2018. https:\/\/www.dpdhl.com\/content\/dam\/dpdhl\/de\/media-relations\/press-releases\/2018\/pm-dhl-paketkopter-tansania-20181004.pdf"},{"issue":"4","key":"25_CR8","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A Goldberg","year":"1988","unstructured":"Goldberg, A., Tarjan, R.: A new approach to the maximum-flow problem. J. ACM 35(4), 921\u2013940 (1988). https:\/\/doi.org\/10.1145\/48014.61051","journal-title":"J. ACM"},{"issue":"4","key":"25_CR9","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1137\/0109047","volume":"9","author":"RE Gomory","year":"1961","unstructured":"Gomory, R.E., Hu, T.C.: Multi-terminal network flows. J. Soc. Ind. Appl. Math. 9(4), 551\u2013570 (1961). https:\/\/doi.org\/10.1137\/0109047","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"25_CR10","unstructured":"H\u00e0, M., Vu, L., Vu, D.: The two-echelon routing problem with truck and drones (2020)"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.trc.2018.03.025","volume":"91","author":"A Ham","year":"2018","unstructured":"Ham, A.: Integrated scheduling of m-truck, m-drone, and m-depot constrained by time-window, drop-pickup, and m-visit using constraint programming. Transp. Res. Part C Emerg. Technol. 91, 1\u201314 (2018). https:\/\/doi.org\/10.1016\/j.trc.2018.03.025","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"25_CR12","doi-asserted-by":"publisher","unstructured":"Henzinger, M., Rao, S., Wang, D.: Local flow partitioning for faster edge connectivity (2017). https:\/\/doi.org\/10.1137\/1.9781611974782.125","DOI":"10.1137\/1.9781611974782.125"},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/j.trc.2019.03.021","volume":"102","author":"A Karak","year":"2019","unstructured":"Karak, A., Abdelghany, K.: The hybrid vehicle-drone routing problem for pick-up and delivery services. Transp. Res. Part C Emerg. Technol. 102, 427\u2013449 (2019). https:\/\/doi.org\/10.1016\/j.trc.2019.03.021","journal-title":"Transp. Res. Part C Emerg. Technol."},{"issue":"4","key":"25_CR14","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1145\/234533.234534","volume":"43","author":"D Karger","year":"1996","unstructured":"Karger, D., Stein, C.: A new approach to the minimum cut problem. J. ACM 43(4), 601\u2013640 (1996). https:\/\/doi.org\/10.1145\/234533.234534","journal-title":"J. ACM"},{"key":"25_CR15","unstructured":"Klein, T.: Konzeption und Realisierung von Separationsalgorithmen f\u00fcr das Traveling Salesman Problem. Master\u2019s project, Hochschule Bonn-Rhein-Sieg (2019)"},{"key":"25_CR16","unstructured":"Klein, T.: Konzeption und Implementierung von Separationsverfahren f\u00fcr das Parallel-Drone-Scheduling-Problem. Master\u2019s thesis, Hochschule Bonn-Rhein-Sieg (2021)"},{"key":"25_CR17","unstructured":"Klohn, H.: Optimierung von TSP-Varianten mit Drohnen durch Branch and Cut Verfahren. Master\u2019s thesis, Hochschule Bonn-Rhein-Sieg (2019)"},{"issue":"3","key":"25_CR18","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1002\/net.10114","volume":"43","author":"M Labb\u00e9","year":"2004","unstructured":"Labb\u00e9, M., Laporte, G., Mart\u00edn, I., Gonz\u00e1lez, J.: The ring star problem: polyhedral analysis and exact algorithm. Networks 43(3), 177\u2013189 (2004). https:\/\/doi.org\/10.1002\/net.10114","journal-title":"Networks"},{"issue":"4","key":"25_CR19","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1002\/net.21846","volume":"72","author":"R Mbiadou Saleu","year":"2018","unstructured":"Mbiadou Saleu, R., Deroussi, L., Feillet, D., Grangeon, N., Quilliot, A.: An iterative two-step heuristic for the parallel drone scheduling traveling salesman problem. Networks 72(4), 459\u2013474 (2018). https:\/\/doi.org\/10.1002\/net.21846","journal-title":"Networks"},{"key":"25_CR20","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.trc.2015.03.005","volume":"54","author":"C Murray","year":"2015","unstructured":"Murray, C., Chu, A.: The flying sidekick traveling salesman problem: optimization of drone-assisted parcel delivery. Transp. Res. Part C Emerg. Technol. 54, 86\u2013109 (2015). https:\/\/doi.org\/10.1016\/j.trc.2015.03.005","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"25_CR21","unstructured":"Reinelt, G.: Tsplib (2021). http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\/"},{"key":"25_CR22","unstructured":"van Dijck, E.: A branch-and-cut algorithm for the traveling salesman problem with drone. Master\u2019s thesis, Erasmus University Rotterdam (2018). https:\/\/thesis.eur.nl\/pub\/44107\/Dijck-van.pdf"}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87672-2_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,21]],"date-time":"2021-09-21T21:10:32Z","timestamp":1632258632000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87672-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030876715","9783030876722"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87672-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"22 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Logistics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccl22021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccl2021.nl\/","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":"111","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":"42","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":"0","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":"38% - 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":"2.5","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":"2","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)"}}]}}