{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T14:09:24Z","timestamp":1774966164880,"version":"3.50.1"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030921200","type":"print"},{"value":"9783030921217","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-92121-7_17","type":"book-chapter","created":{"date-parts":[[2021,12,8]],"date-time":"2021-12-08T17:13:15Z","timestamp":1638983595000},"page":"198-210","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["The Shortest Simple Path Problem with\u00a0a\u00a0Fixed Number of\u00a0Must-Pass Nodes: A\u00a0Problem-Specific Branch-and-Bound Algorithm"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5683-4862","authenticated-orcid":false,"given":"Andrei","family":"Kudriavtsev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9276-4128","authenticated-orcid":false,"given":"Daniel","family":"Khachay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1750-1368","authenticated-orcid":false,"given":"Yuri","family":"Ogorodnikov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Ren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheng\u00a0Cheng","family":"Shao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3555-0080","authenticated-orcid":false,"given":"Michael","family":"Khachay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,9]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","unstructured":"Castro de Andrade, R.: New formulations for the elementary shortest-path problem visiting a given set of nodes. Eur. J. Oper. Res. 254(3), 755\u2013768 (2016). https:\/\/doi.org\/10.1016\/j.ejor.2016.05.008","DOI":"10.1016\/j.ejor.2016.05.008"},{"issue":"6","key":"17_CR2","doi-asserted-by":"publisher","first-page":"1698","DOI":"10.1137\/18M1223034","volume":"48","author":"A Bj\u00f6rklund","year":"2019","unstructured":"Bj\u00f6rklund, A., Husfeldt, T.: Shortest two disjoint paths in polynomial time. SIAM J. Comput. 48(6), 1698\u20131710 (2019). https:\/\/doi.org\/10.1137\/18M1223034","journal-title":"SIAM J. Comput."},{"issue":"4","key":"17_CR3","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1287\/opre.2.4.393","volume":"2","author":"G Dantzig","year":"1954","unstructured":"Dantzig, G., Fulkerson, R., Johnson, S.: Solution of a large-scale traveling salesman problem. J. Oper. Res. Soc. Am. 2(4), 393\u2013410 (1954). https:\/\/doi.org\/10.1287\/opre.2.4.393","journal-title":"J. Oper. Res. Soc. Am."},{"key":"17_CR4","unstructured":"Datta, S., Iyer, S., Kulkarni, R., Mukherjee, A.: Shortest $$k$$-disjoint paths via determinants, February 2018"},{"issue":"1","key":"17_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269\u2013271 (1959). https:\/\/doi.org\/10.1007\/BF01386390","journal-title":"Numer. Math."},{"key":"17_CR6","unstructured":"DIMACS: 9th DIMACS Implementation Challenge - Shortest Paths (2006). http:\/\/users.diag.uniroma1.it\/challenge9\/download.shtml. Accessed 4 Feb 2021"},{"key":"17_CR7","doi-asserted-by":"publisher","unstructured":"Dreyfus, S.: An appraisal of some shortest path algorithm. Oper. Res. 17, 395\u2013412 (1969). https:\/\/doi.org\/10.1287\/opre.17.3.395","DOI":"10.1287\/opre.17.3.395"},{"issue":"2","key":"17_CR8","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S Fortune","year":"1980","unstructured":"Fortune, S., Hopcroft, J., Wyllie, J.: The directed subgraph homeomorphism problem. Theor. Comput. Sci. 10(2), 111\u2013121 (1980). https:\/\/doi.org\/10.1016\/0304-3975(80)90009-2","journal-title":"Theor. Comput. Sci."},{"key":"17_CR9","doi-asserted-by":"publisher","unstructured":"Gomes, T., Martins, L., Ferreira, S., Pascoal, M., Tipper, D.: Algorithms for determining a node-disjoint path pair visiting specified nodes. Opt. Switch. Netw. 23 (2017). https:\/\/doi.org\/10.1016\/j.osn.2016.05.002","DOI":"10.1016\/j.osn.2016.05.002"},{"key":"17_CR10","unstructured":"Gurobi Optimization LLC.: Gurobi optimizer reference manual (2020). http:\/\/www.gurobi.com"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Ibaraki, T.: Algorithms for obtaining shortest paths visiting specified nodes. SIAM Rev. 15(2), 309\u2013317 (1973). http:\/\/www.jstor.org\/stable\/2028603","DOI":"10.1137\/1015031"},{"key":"17_CR12","doi-asserted-by":"publisher","unstructured":"Karp, R.: Reducibility among combinatorial problems. vol. 40, pp. 85\u2013103 (01 1972). https:\/\/doi.org\/10.1007\/978-3-540-68279-0_8","DOI":"10.1007\/978-3-540-68279-0_8"},{"key":"17_CR13","doi-asserted-by":"publisher","unstructured":"Martins, L., Gomes, T., Tipper, D.: Efficient heuristics for determining node-disjoint path pairs visiting specified nodes. Networks 70(4), 292\u2013307 (2017) https:\/\/doi.org\/10.1002\/net.21778","DOI":"10.1002\/net.21778"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Rak, J.: Resilient Routing in Communication Networks. Computer Communications and Networks, Springer (2015)","DOI":"10.1007\/978-3-319-22333-9"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Saksena, J.P., Kumar, S.: The routing problem with \u2018K\u2019 specified nodes. Oper. Res. 14(5), 909\u2013913 (1966). http:\/\/www.jstor.org\/stable\/168788","DOI":"10.1287\/opre.14.5.909"},{"key":"17_CR16","doi-asserted-by":"publisher","unstructured":"Su, Z., Zhang, J., Lu, Z.: A multi-stage metaheuristic algorithm for shortest simple path problem with must-pass nodes. IEEE Access 7, 52142\u201352154 (2019). https:\/\/doi.org\/10.1109\/ACCESS.2019.2908011","DOI":"10.1109\/ACCESS.2019.2908011"},{"key":"17_CR17","doi-asserted-by":"publisher","unstructured":"Verdi\u00e8re, E.C.D., Schrijver, A.: Shortest vertex-disjoint two-face paths in planar graphs ACM Trans. Algor. 7(2), 1\u201312 (2011). https:\/\/doi.org\/10.1145\/1921659.1921665","DOI":"10.1145\/1921659.1921665"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92121-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,8]],"date-time":"2021-12-08T17:15:00Z","timestamp":1638983700000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92121-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030921200","9783030921217"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92121-7_17","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":"9 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lion15.sba-research.org\/index.html","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":"35","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":"86% - 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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}