search query: @indexterm Dynamic programming / total: 309
reference: 26 / 309
| Author: | Flippo, O. |
| Title: | A dynamic programming algorithm for the local access telecommunication network expansion problem |
| Journal: | European Journal of Operational Research
2000 : NOV 16, VOL. 127:1, p. 189-202 |
| Index terms: | DYNAMIC PROGRAMMING TELECOMMUNICATION OPTIMIZATION |
| Language: | eng |
| Abstract: | In this paper, the authors consider the local access telecommunication network expansion problem, in which growing demand can be satisfied by expanding cable capacities and/or installing concentrators in the network. The problem is known to be NP-hard. The authors prove that the problem is weakly NP-hard, and present a pseudo- polynomial dynamic programming algorithm for the problem. |
SCIMA