.png){kind=icon}
.png){kind=icon}
Return
Target-based Distributionally Robust Minimum Spanning Tree Problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2026.02.024.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• Propose a target-based distributionally robust MST model for stochastic graphs. • Handle unknown edge-weight distributions using partial statistical information. • Develop three exact algorithms: a BD method and two modified Prim heuristics. • Achieve better robustness and efficiency than classical stochastic MST variants. • Scale effectively to large networks under significant edge-weight uncertainty.
Keywords:
Minimum Spanning tree
Target-based
Distributionally robust optimization
Stochastic graph
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
View more organizations