Finding conflict-free minimum weight spanning trees using maximal stable sets of the conflict graph
European Journal of Operational Research · 2026-11 · 334 (3) · 781-797
DOI: 10.1016/j.ejor.2026.03.017 ↗Kurz gefasst
Fachartikel in der Zeitschrift European Journal of Operational Research, 2026-11. Verfasst von Murat Umut İzer und 2 weiteren Autor:innen. Die Arbeit nennt 59 Literaturangaben. Gefördert von: Boğaziçi Üniversitesi.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Boğaziçi Üniversitesi
Zitieren
APA
İzer, M. U., Öncan, T., & Altınel, İ. K. (2026). Finding conflict-free minimum weight spanning trees using maximal stable sets of the conflict graph. European Journal of Operational Research, 334(3), 781-797. https://doi.org/10.1016/j.ejor.2026.03.017
Vancouver
İzer MU, Öncan T, Altınel İK. Finding conflict-free minimum weight spanning trees using maximal stable sets of the conflict graph. European Journal of Operational Research. 2026;334(3):781-797. doi:10.1016/j.ejor.2026.03.017
BibTeX
@article{zer2026,
author = {İzer, Murat Umut and Öncan, Temel and Altınel, İ. Kuban},
title = {Finding conflict-free minimum weight spanning trees using maximal stable sets of the conflict graph},
journal = {European Journal of Operational Research},
year = {2026},
volume = {334},
number = {3},
pages = {781--797},
doi = {10.1016/j.ejor.2026.03.017}
}
EUVIMED