{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T11:10:01Z","timestamp":1755861001180,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T00:00:00Z","timestamp":1730160000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,10,29]]},"DOI":"10.1145\/3678717.3691327","type":"proceedings-article","created":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T06:29:21Z","timestamp":1732256961000},"page":"489-492","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Customizable Routing with Learnings from Past Recommendations"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-0925-1103","authenticated-orcid":false,"given":"Kuo-Han","family":"Hung","sequence":"first","affiliation":[{"name":"Microsoft, Taipei, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4332-6126","authenticated-orcid":false,"given":"Chiqun","family":"Zhang","sequence":"additional","affiliation":[{"name":"Microsoft, Mountain View, United States"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-4509-3222","authenticated-orcid":false,"given":"Dragomir","family":"Yankov","sequence":"additional","affiliation":[{"name":"Microsoft, Mountain View, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,11,22]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Geometric deep learning: Grids, groups, graphs, geodesics, and gauges. arXiv preprint arXiv:2104.13478","author":"Bronstein Michael M","year":"2021","unstructured":"Michael M Bronstein, Joan Bruna, Taco Cohen, and Petar Veli\u010dkovi\u0107. 2021. Geometric deep learning: Grids, groups, graphs, geodesics, and gauges. arXiv preprint arXiv:2104.13478 (2021)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2017.2693418"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2014.0579"},{"volume-title":"Algorithmics of large and complex networks: design, analysis, and simulation","author":"Delling Daniel","key":"e_1_3_2_1_4_1","unstructured":"Daniel Delling, Peter Sanders, Dominik Schultes, and Dorothea Wagner. 2009. Engineering route planning algorithms. In Algorithmics of large and complex networks: design, analysis, and simulation. Springer, 117--139."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Edsger W Dijkstra. 2022. A note on two problems in connexion with graphs. In Edsger Wybe Dijkstra: His Life Work and Legacy. 287--290.","DOI":"10.1145\/3544585.3544600"},{"key":"e_1_3_2_1_6_1","volume-title":"Dijkstras algorithm with predictions to solve the single-source many-targets shortest-path problem. arXiv preprint arXiv:2112.11927","author":"Feijen Willem","year":"2021","unstructured":"Willem Feijen and Guido Sch\u00e4fer. 2021. Dijkstras algorithm with predictions to solve the single-source many-targets shortest-path problem. arXiv preprint arXiv:2112.11927 (2021)."},{"key":"e_1_3_2_1_7_1","volume-title":"When Large Language Model Meets Optimization. arXiv preprint arXiv:2405.10098","author":"Huang Sen","year":"2024","unstructured":"Sen Huang, Kaixiang Yang, Sheng Qi, and Rui Wang. 2024. When Large Language Model Meets Optimization. arXiv preprint arXiv:2405.10098 (2024)."},{"key":"e_1_3_2_1_8_1","volume-title":"Better Planning with Transformers via Search Dynamics Bootstrapping. arXiv preprint arXiv:2402.14083","author":"Lehnert Lucas","year":"2024","unstructured":"Lucas Lehnert, Sainbayar Sukhbaatar, Paul Mcvay, Michael Rabbat, and Yuandong Tian. 2024. Beyond A*: Better Planning with Transformers via Search Dynamics Bootstrapping. arXiv preprint arXiv:2402.14083 (2024)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2530531"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/3603581.3603591"},{"key":"e_1_3_2_1_11_1","volume-title":"On the robust shortest path problem. Computers & operations research 25, 6","author":"Yu Gang","year":"1998","unstructured":"Gang Yu and Jian Yang. 1998. On the robust shortest path problem. Computers & operations research 25, 6 (1998), 457--468."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589132.3625595"}],"event":{"name":"SIGSPATIAL '24: The 32nd ACM International Conference on Advances in Geographic Information Systems","sponsor":["SIGSPATIAL ACM Special Interest Group on Spatial Information"],"location":"Atlanta GA USA","acronym":"SIGSPATIAL '24"},"container-title":["Proceedings of the 32nd ACM International Conference on Advances in Geographic Information Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3678717.3691327","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3678717.3691327","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T10:40:52Z","timestamp":1755859252000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3678717.3691327"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,29]]},"references-count":12,"alternative-id":["10.1145\/3678717.3691327","10.1145\/3678717"],"URL":"https:\/\/doi.org\/10.1145\/3678717.3691327","relation":{},"subject":[],"published":{"date-parts":[[2024,10,29]]},"assertion":[{"value":"2024-11-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}