Open Access · CC BY 4.0
Solving the Safest-Shortest Path Problem under Correlated Failures in Backbone Networks with Ant Colony Optimization
IEEE Access · 2026 · 1-1
DOI: 10.1109/access.2026.3752150 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Access, 2026. Verfasst von Zoltán Tasnádi und 2 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Ministry of Research, Innovation and Digitization, CNCS-UEFISCDI.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Ministry of Research, Innovation and Digitization, CNCS-UEFISCDI
Zitieren
APA
Tasnádi, Z., Vass, B., & Gaskó, N. (2026). Solving the Safest-Shortest Path Problem under Correlated Failures in Backbone Networks with Ant Colony Optimization. IEEE Access, 1-1. https://doi.org/10.1109/access.2026.3752150
Vancouver
Tasnádi Z, Vass B, Gaskó N. Solving the Safest-Shortest Path Problem under Correlated Failures in Backbone Networks with Ant Colony Optimization. IEEE Access. 2026:1-1. doi:10.1109/access.2026.3752150
BibTeX
@article{Tasndi2026,
author = {Tasnádi, Zoltán and Vass, Balázs and Gaskó, Noémi},
title = {Solving the Safest-Shortest Path Problem under Correlated Failures in Backbone Networks with Ant Colony Optimization},
journal = {IEEE Access},
year = {2026},
pages = {1--1},
doi = {10.1109/access.2026.3752150}
}
EUVIMED