On Solving the Minimum Spanning Tree Problem with Conflicting Edge Pairs
The Minimum Spanning Tree with Conflicting Edge Pairs is a generalization that adds conflict constraints to a classical optimization problem on graphs used to model several real-world applications. In recent years, several heuristic and exact approaches have been proposed to tackle this problem. In...
| 出版年: | Algorithms |
|---|---|
| 主要な著者: | , |
| フォーマット: | 論文 |
| 言語: | 英語 |
| 出版事項: |
MDPI AG
2025-08-01
|
| 主題: | |
| オンライン･アクセス: | https://www.mdpi.com/1999-4893/18/8/526 |