Finding conflict-free minimum weight spanning trees using maximal stable sets of the conflict graph

View at publisher Summarise with VIRAT
Authors: Murat Umut İzer, Temel Öncan, İ. Kuban Altınel
Cited by: 0
References: 51

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Fields of Study & Subjects

Complexity and Algorithms in Graphs Vehicle Routing Optimization Methods Optimization and Mathematical Programming

Publication details

Journal / source
European Journal of Operational Research
Volume
334
Issue
3
Pages
781–797
Publication date
21 March 2026
Language
EN