Solving the Extended Tree Knapsack Problem with fixed cost flow expansion functions

Solving the Extended Tree Knapsack Problem with fixed cost flow expansion functions

Parts of the Local Access Telecommunication Network planning problem may be modelled as an Extended Tree Knapsack Problem. The Local Access Telecommunication Network can contribute up to 60% of the total network costs. This paper presents partitioning algorithms that use standard off-the-shelf softw...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Orion (Johannesburg, South Africa) South Africa), 2010-06, Vol.26 (1), p.1
Hauptverfasser: Van der Merwe, DJ, Hattingh, JM
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Communications networks
Fixed costs
Knapsack problem
Optimization
Studies
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Parts of the Local Access Telecommunication Network planning problem may be modelled as an Extended Tree Knapsack Problem. The Local Access Telecommunication Network can contribute up to 60% of the total network costs. This paper presents partitioning algorithms that use standard off-the-shelf software coupled with enhanced modelling. Enhancements to the algorithms and empirical results for both the Tree Knapsack Problem and Extended Tree Knapsack Problem are presented. [PUBLICATION ABSTRACT]
ISSN:2224-0004
0259-191X
2224-0004
DOI:10.5784/26-1-82