{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:58Z","timestamp":1759639078714,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030174019"},{"type":"electronic","value":"9783030174026"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17402-6_13","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T13:37:00Z","timestamp":1558359420000},"page":"149-160","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Complexity of Scheduling for DARP with Soft Ride Times"],"prefix":"10.1007","author":[{"given":"Janka","family":"Chleb\u00edkov\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cl\u00e9ment","family":"Dallard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Niklas","family":"Paulsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,6]]},"reference":[{"issue":"5","key":"13_CR1","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/BF01192049","volume":"14","author":"MJ Atallah","year":"1995","unstructured":"Atallah, M.J., Chen, D.Z., Lee, D.T.: An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications. Algorithmica 14(5), 429\u2013441 (1995). https:\/\/doi.org\/10.1007\/BF01192049","journal-title":"Algorithmica"},{"issue":"2","key":"13_CR2","first-page":"89","volume":"1","author":"JF Cordeau","year":"2003","unstructured":"Cordeau, J.F., Laporte, G.: The dial-a-ride problem (DARP): variants, modeling issues and algorithms. Q. J. Belg. Fr. Ital. Oper. Res. Soc. 1(2), 89\u2013101 (2003)","journal-title":"Q. J. Belg. Fr. Ital. Oper. Res. Soc."},{"key":"13_CR3","unstructured":"Crescenzi, P.: A short guide to approximation preserving reductions. In: Proceedings of the 12th Annual IEEE Conference on Computational Complexity. CCC \u201997, pp. 262\u2013273. IEEE Computer Society, Washington (1997)"},{"key":"13_CR4","first-page":"35","volume":"8","author":"J Desrosiers","year":"1995","unstructured":"Desrosiers, J., Dumas, Y., Solomon, M.M., Soumis, F.: Time constrained routing and scheduling. Handb. Oper. Res. Manag. Sci. 8, 35\u2013139 (1995)","journal-title":"Handb. Oper. Res. Manag. Sci."},{"issue":"2","key":"13_CR5","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1287\/trsc.24.2.145","volume":"24","author":"Y Dumas","year":"1990","unstructured":"Dumas, Y., Soumis, F., Desrosiers, J.: Optimizing the schedule for a fixed vehicle path with convex inconvenience costs. Transp. Sci. 24(2), 145\u2013152 (1990)","journal-title":"Transp. Sci."},{"issue":"1","key":"13_CR6","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.orl.2010.11.004","volume":"39","author":"M Firat","year":"2011","unstructured":"Firat, M., Woeginger, G.J.: Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh. Oper. Res. Lett. 39(1), 32\u201335 (2011)","journal-title":"Oper. Res. Lett."},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/11604686_20","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M Gatto","year":"2005","unstructured":"Gatto, M., Jacob, R., Peeters, L., Sch\u00f6bel, A.: The computational complexity of delay management. In: Kratsch, D. (ed.) WG 2005. LNCS, vol. 3787, pp. 227\u2013238. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11604686_20"},{"key":"13_CR8","unstructured":"Gschwind, T.: Route feasibility testing and forward time slack for the synchronized pickup and delivery problem. Technical report, Citeseer (2015)"},{"issue":"3","key":"13_CR9","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/S0167-6377(02)00120-7","volume":"30","author":"B Hunsaker","year":"2002","unstructured":"Hunsaker, B., Savelsbergh, M.: Efficient feasibility testing for dial-a-ride problems. Oper. Res. Lett. 30(3), 169\u2013173 (2002)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"13_CR10","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.disopt.2010.03.010","volume":"8","author":"M Lampis","year":"2011","unstructured":"Lampis, M., Kaouri, G., Mitsou, V.: On the algorithmic effectiveness of digraph decompositions and complexity measures. Discrete Optim. 8(1), 129\u2013138 (2011). https:\/\/doi.org\/10.1016\/j.disopt.2010.03.010","journal-title":"Discrete Optim."},{"issue":"5","key":"13_CR11","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.orl.2010.05.002","volume":"38","author":"J Tang","year":"2010","unstructured":"Tang, J., Kong, Y., Lau, H., Ip, A.W.: A note on efficient feasibility testing for dial-a-ride problems. Oper. Res. Lett. 38(5), 405\u2013407 (2010)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"13_CR12","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BF00268499","volume":"6","author":"RE Tarjan","year":"1976","unstructured":"Tarjan, R.E.: Edge-disjoint spanning trees and depth-first search. Acta Informatica 6(2), 171\u2013185 (1976)","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17402-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:27:52Z","timestamp":1710347272000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-17402-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030174019","9783030174026"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17402-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/easyconferences.eu\/ciac2019\/","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":"95","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":"30","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":"32% - 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","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":"14","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)"}}]}}