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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Operations Research Society of South Africa (ORSSA)
2010-06-01
|
| Series: | ORiON |
| Online Access: | http://orion.journals.ac.za/pub/article/view/82 |