Jackiewicz, M., Kasperski, A., & Zieliński, P. (2024). Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse.
Citazione stile Chigago Style (17a edizione)Jackiewicz, Marcel, Adam Kasperski, e Paweł Zieliński. Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse. 2024.
Citatione MLA (9a ed.)Jackiewicz, Marcel, et al. Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse. 2024.
Attenzione: Queste citazioni potrebbero non essere precise al 100%.