The generalized minimum spanning tree problem: An overview of formulations, solution procedures and latest advances
•We focus on the generalized minimum spanning tree problem.•Some of the main known results relative to this problem are surveyed.•The paper is structured around the following main headings: definition, complexity aspects, models and solution approaches. In this paper, some of the main known results...
Gespeichert in:
| Veröffentlicht in: | European journal of operational research Jg. 283; H. 1; S. 1 - 15 |
|---|---|
| 1. Verfasser: | |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier B.V
16.05.2020
|
| Schlagworte: | |
| ISSN: | 0377-2217, 1872-6860 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | •We focus on the generalized minimum spanning tree problem.•Some of the main known results relative to this problem are surveyed.•The paper is structured around the following main headings: definition, complexity aspects, models and solution approaches.
In this paper, some of the main known results relative to the generalized minimum spanning tree problem are surveyed. The principal feature of this problem is related to the fact that the vertices of the graph are partitioned into a certain number of clusters and we are interested in finding a minimum-cost tree spanning a subset of vertices with precisely one vertex considered from every cluster. The paper is structured around the following main headings: problem definition, variations and practical applications, complexity aspects, integer programming formulations, exact and heuristic solution approaches developed for solving this problem. Furthermore, we also discuss some open problems and possible research directions. |
|---|---|
| ISSN: | 0377-2217 1872-6860 |
| DOI: | 10.1016/j.ejor.2019.05.017 |