An addendum to the hierarchical network design problem

The hierarchical network design problem is the problem to find a spanning tree of minimum total weight, when the edges of the path between two given nodes are weighted by an other cost function than the tree edges not on this path. We point out that a dynamic programming oriented heuristic can alrea...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:European journal of operational research 1996-07, Vol.92 (1), p.214-216
Hauptverfasser: Duin, C.W., Volgenant, A.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The hierarchical network design problem is the problem to find a spanning tree of minimum total weight, when the edges of the path between two given nodes are weighted by an other cost function than the tree edges not on this path. We point out that a dynamic programming oriented heuristic can already be found in literature. Further we report on possible extensions and improvements.
ISSN:0377-2217
1872-6860
DOI:10.1016/0377-2217(96)00016-1