WEISS, Eyal. A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates (Student Abstract). Proceedings of the International Symposium on Combinatorial Search, [S. l.], v. 16, n. 1, p. 206–207, 2023. DOI: 10.1609/socs.v16i1.27316. Disponível em: https://ojs.aaai.org/index.php/SOCS/article/view/27316. Acesso em: 25 may. 2026.