{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T06:57:37Z","timestamp":1773385057671,"version":"3.50.1"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030589417","type":"print"},{"value":"9783030589424","type":"electronic"}],"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_11","type":"book-chapter","created":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T06:03:58Z","timestamp":1600409038000},"page":"167-175","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Transfer-Expanded Graphs for On-Demand Multimodal Transit Systems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4304-7517","authenticated-orcid":false,"given":"Kevin","family":"Dalmeijer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7085-9994","authenticated-orcid":false,"given":"Pascal","family":"Van Hentenryck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,19]]},"reference":[{"issue":"3","key":"11_CR1","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1002\/nav.3800250314","volume":"25","author":"YP Aneja","year":"1978","unstructured":"Aneja, Y.P., Nair, K.P.K.: The constrained shortest path problem. Naval Res. Logistics Q. 25(3), 549\u2013555 (1978). \nhttps:\/\/doi.org\/10.1002\/nav.3800250314","journal-title":"Naval Res. Logistics Q."},{"issue":"1","key":"11_CR2","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"JF Benders","year":"1962","unstructured":"Benders, J.F.: Partitioning procedures for solving mixed-variables programming problems. Numer. Math. 4(1), 238\u2013252 (1962)","journal-title":"Numer. Math."},{"issue":"5","key":"11_CR3","doi-asserted-by":"publisher","first-page":"1303","DOI":"10.1287\/opre.2017.1624","volume":"65","author":"N Boland","year":"2017","unstructured":"Boland, N., Hewitt, M., Marshall, L., Savelsbergh, M.: The continuous-time service network design problem. Oper. Res. 65(5), 1303\u20131321 (2017). \nhttps:\/\/doi.org\/10.1287\/opre.2017.1624","journal-title":"Oper. Res."},{"issue":"4","key":"11_CR4","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1287\/opre.1060.0286","volume":"54","author":"G Codato","year":"2006","unstructured":"Codato, G., Fischetti, M.: Combinatorial Benders\u2019 cuts for mixed-integer linear programming. Oper. Res. 54(4), 756\u2013766 (2006). \nhttps:\/\/doi.org\/10.1287\/opre.1060.0286","journal-title":"Oper. Res."},{"key":"11_CR5","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. The MIT Press (2009)"},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/1097-0037(200008)36:1<1::AID-NET1>3.0.CO;2-B","volume":"36","author":"G Dahl","year":"2000","unstructured":"Dahl, G., Realfsen, B.: The cardinality-constrained shortest path problem in 2-graphs. Networks 36(1), 1\u20138 (2000)","journal-title":"Networks"},{"issue":"7","key":"11_CR7","doi-asserted-by":"publisher","first-page":"2146","DOI":"10.1287\/mnsc.2016.2461","volume":"63","author":"M Fischetti","year":"2017","unstructured":"Fischetti, M., Ljubi\u0107, I., Sinnl, M.: Redesigning Benders decomposition for large-scale facility location. Manag. Sci. 63(7), 2146\u20132162 (2017). \nhttps:\/\/doi.org\/10.1287\/mnsc.2016.2461","journal-title":"Manag. Sci."},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.cor.2018.09.007","volume":"102","author":"L Gouveia","year":"2019","unstructured":"Gouveia, L., Leitner, M., Ruthmair, M.: Layered graph approaches for combinatorial optimization problems. Comput. Oper. Res. 102, 22\u201338 (2019). \nhttps:\/\/doi.org\/10.1016\/j.cor.2018.09.007","journal-title":"Comput. Oper. Res."},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/978-3-319-66158-2_35","volume-title":"Principles and Practice of Constraint Programming","author":"MH Hasan","year":"2017","unstructured":"Hasan, M.H., Van Hentenryck, P.: A column-generation algorithm for evacuation planning with elementary paths. In: Beck, J.C. (ed.) CP 2017. LNCS, vol. 10416, pp. 549\u2013564. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-66158-2_35"},{"issue":"3","key":"11_CR10","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/opre.50.3.415.7751","volume":"50","author":"G Laporte","year":"2002","unstructured":"Laporte, G., Louveaux, F.V., Van Hamme, L.: An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands. Oper. Res. 50(3), 415\u2013423 (2002). \nhttps:\/\/doi.org\/10.1287\/opre.50.3.415.7751","journal-title":"Oper. Res."},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1287\/trsc.2017.0756","volume":"53","author":"A Mah\u00e9o","year":"2019","unstructured":"Mah\u00e9o, A., Kilby, P., Van Hentenryck, P.: Benders decomposition for the design of a hub and shuttle public transit system. Transp. Sci. 53(1), 77\u201388 (2019). \nhttps:\/\/doi.org\/10.1287\/trsc.2017.0756","journal-title":"Transp. Sci."},{"issue":"9","key":"11_CR12","doi-asserted-by":"publisher","first-page":"2670","DOI":"10.1016\/j.cor.2008.11.022","volume":"36","author":"L Moccia","year":"2009","unstructured":"Moccia, L., Cordeau, J.F., Monaco, M.F., Sammarra, M.: A column generation heuristic for a dynamic generalized assignment problem. Comput. Oper. Res. 36(9), 2670\u20132681 (2009). \nhttps:\/\/doi.org\/10.1016\/j.cor.2008.11.022","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"11_CR13","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10601-015-9189-7","volume":"20","author":"V Pillac","year":"2015","unstructured":"Pillac, V., Cebrian, M., Van Hentenryck, P.: A column-generation approach for joint mobilization and evacuation planning. Constraints 20(3), 285\u2013303 (2015). \nhttps:\/\/doi.org\/10.1007\/s10601-015-9189-7","journal-title":"Constraints"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.trb.2015.09.008","volume":"83","author":"V Pillac","year":"2016","unstructured":"Pillac, V., Van Hentenryck, P., Even, C.: A conflict-based path-generation heuristic for evacuation planning. Transp. Res. Part B: Methodol. 83, 136\u2013150 (2016). \nhttps:\/\/doi.org\/10.1016\/j.trb.2015.09.008","journal-title":"Transp. Res. Part B: Methodol."}],"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_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T06:08:44Z","timestamp":1600409324000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58942-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030589417","9783030589424"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58942-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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)"}}]}}