An efficient hierarchical constructive heuristic for large-scale survivable traffic grooming problem under double-link failures
Computers & Operations Research · 2027-04 · 197 · 107714
DOI: 10.1016/j.cor.2026.107714 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computers & Operations Research, 2027-04. Verfasst von Silong Zhang und 5 weiteren Autor:innen. Die Arbeit nennt 34 Literaturangaben.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Zhang, S., Feng, J., Liu, J., Liu, Y., Xu, Z., & Zhang, F. (2027). An efficient hierarchical constructive heuristic for large-scale survivable traffic grooming problem under double-link failures. Computers & Operations Research, 197, 107714. https://doi.org/10.1016/j.cor.2026.107714
Vancouver
Zhang S, Feng J, Liu J, Liu Y, Xu Z, Zhang F. An efficient hierarchical constructive heuristic for large-scale survivable traffic grooming problem under double-link failures. Computers & Operations Research. 2027;197:107714. doi:10.1016/j.cor.2026.107714
BibTeX
@article{Zhang2027,
author = {Zhang, Silong and Feng, Jixuan and Liu, Junyan and Liu, Yu and Xu, Zhou and Zhang, Fan},
title = {An efficient hierarchical constructive heuristic for large-scale survivable traffic grooming problem under double-link failures},
journal = {Computers & Operations Research},
year = {2027},
volume = {197},
pages = {107714},
doi = {10.1016/j.cor.2026.107714}
}
EUVIMED