{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T08:10:08Z","timestamp":1751703008650,"version":"3.41.0"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031976346","type":"print"},{"value":"9783031976353","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-97635-3_36","type":"book-chapter","created":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T07:42:10Z","timestamp":1751701330000},"page":"300-308","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["SOPMOA*: Unleashing Shared-Open Parallelism for\u00a0High-Performance Multi-Objective Pathfinding"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-2213-4184","authenticated-orcid":false,"given":"Long Viet","family":"Truong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-7683-4476","authenticated-orcid":false,"given":"Tien Minh","family":"Dam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tuan Anh","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Linh Thuy Thi","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Duong Trung","family":"Dinh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,6]]},"reference":[{"key":"36_CR1","doi-asserted-by":"publisher","unstructured":"Ahmadi, S.: Parallelizing multi-objective A* search (extended abstract). In: Proceedings of the International Symposium on Combinatorial Search, vol. 17, pp. 253\u2013254 (2024). https:\/\/doi.org\/10.1609\/socs.v17i1.31567","DOI":"10.1609\/socs.v17i1.31567"},{"key":"36_CR2","doi-asserted-by":"publisher","unstructured":"Ahmadi, S., Sturtevant, N.R., Harabor, D., Jalili, M.: Exact multi-objective path finding with negative weights. In: Proceedings of the International Conference on Automated Planning and Scheduling, vol. 34, pp. 11\u201319 (2024). https:\/\/doi.org\/10.1609\/icaps.v34i1.31455","DOI":"10.1609\/icaps.v34i1.31455"},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"Ahmadi, S., Tack, G., Harabor, D., Kilby, P.: Bi-Objective Search with Bi-Directional A*. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)","DOI":"10.1609\/socs.v12i1.18563"},{"key":"36_CR4","doi-asserted-by":"publisher","unstructured":"Maristany de\u00a0las Casas, P., Sedeno-Noda, A., Bornd\u00f6rfer, R.: An improved multiobjective shortest path algorithm. Comput. Oper. Res. 135, 105424 (2021). https:\/\/doi.org\/10.1016\/j.cor.2021.105424","DOI":"10.1016\/j.cor.2021.105424"},{"key":"36_CR5","doi-asserted-by":"publisher","unstructured":"Maristany de las Casas, P., Kraus, L., Sede\u00f1o-Noda, A., Bornd\u00f6rfer, R.: Targeted multiobjective dijkstra algorithm (2021). https:\/\/doi.org\/10.48550\/ARXIV.2110.10978. https:\/\/arxiv.org\/abs\/2110.10978","DOI":"10.48550\/ARXIV.2110.10978"},{"key":"36_CR6","doi-asserted-by":"publisher","unstructured":"Hern\u00e1ndez, C., et al.: Multi-objective search via lazy and efficient dominance checks. In: Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, pp. 7223\u20137230. International Joint Conferences on Artificial Intelligence Organization (2023). https:\/\/doi.org\/10.24963\/ijcai.2023\/850","DOI":"10.24963\/ijcai.2023\/850"},{"issue":"5\u20136","key":"36_CR7","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1002\/mcda.1541","volume":"22","author":"FA Medrano","year":"2015","unstructured":"Medrano, F.A., Church, R.L.: A parallel computing framework for finding the supported solutions to a biobjective network optimization problem. J. Multi-Criteria Decis. Anal. 22(5\u20136), 244\u2013259 (2015). https:\/\/doi.org\/10.1002\/mcda.1541","journal-title":"J. Multi-Criteria Decis. Anal."},{"key":"36_CR8","doi-asserted-by":"publisher","unstructured":"Pulido, F.J., Mandow, L., P\u00e9rez-de-la Cruz, J.L.: Dimensionality reduction in multiobjective shortest path search. Comput. Oper. Res. 64, 60\u201370 (2015). https:\/\/doi.org\/10.1016\/j.cor.2015.05.007","DOI":"10.1016\/j.cor.2015.05.007"},{"key":"36_CR9","doi-asserted-by":"publisher","unstructured":"Ren, Z., Zhan, R., Rathinam, S., Likhachev, M., Choset, H.: Enhanced multi-objective A* using balanced binary search trees. In: Proceedings of the International Symposium on Combinatorial Search, vol. 15, no. 1, pp. 162\u2013170 (2022). https:\/\/doi.org\/10.1609\/socs.v15i1.21764","DOI":"10.1609\/socs.v15i1.21764"},{"key":"36_CR10","doi-asserted-by":"publisher","unstructured":"Sanders, P., Mandow, L.: Parallel label-setting multi-objective shortest path search. In: 2013 IEEE 27th International Symposium on Parallel and Distributed Processing, pp. 215\u2013224. IEEE (2013). https:\/\/doi.org\/10.1109\/ipdps.2013.89","DOI":"10.1109\/ipdps.2013.89"},{"issue":"1","key":"36_CR11","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.ejor.2019.01.007","volume":"276","author":"A Sede\u00f1o-noda","year":"2019","unstructured":"Sede\u00f1o-noda, A., Colebrook, M.: A biobjective Dijkstra algorithm. Eur. J. Oper. Res. 276(1), 106\u2013118 (2019). https:\/\/doi.org\/10.1016\/j.ejor.2019.01.007","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-97635-3_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T07:42:12Z","timestamp":1751701332000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-97635-3_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031976346","9783031976353"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-97635-3_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"6 July 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}