| dc.contributor.author | Terblanche, S.E. | |
| dc.contributor.author | Hattingh, J.M. | |
| dc.contributor.author | Wessläy, R. | |
| dc.date.accessioned | 2012-10-05T06:47:19Z | |
| dc.date.available | 2012-10-05T06:47:19Z | |
| dc.date.issued | 2011 | |
| dc.identifier.citation | Terblanche, S.E. et al. 2011. Survivable network design with demand uncertainty. European journal of operational research, 210(1):10-26. [https://doi.org/10.1016/j.ejor.2010.09.041] | en_US |
| dc.identifier.issn | 0377-2217 | |
| dc.identifier.uri | http://hdl.handle.net/10394/7440 | |
| dc.identifier.uri | https://doi.org/10.1016/j.ejor.2010.09.041 | |
| dc.identifier.uri | http://www.sciencedirect.com/science/article/pii/S0377221710006399 | |
| dc.description.abstract | The objective in designing a communications network is to find the most cost efficient network design that specifies hardware devices to be installed, the type of transmission links to be installed, and the routing strategy to be followed. In this paper algorithmic ideas are presented for improving tractability in solving the survivable network design problem by taking into account uncertainty in the traffic requirements. Strategies for improving separation of metric inequalities are presented and an iterative approach for obtaining solutions, that significantly reduces computing times, is introduced. Computational results are provided based on data collected from an operational network. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Elsevier | en_US |
| dc.subject | Integer programming | en_US |
| dc.subject | stochastic programming | en_US |
| dc.subject | roboust optimisation | en_US |
| dc.subject | telecommunication | en_US |
| dc.title | Survivable network design with demand uncertainty | en_US |
| dc.type | Article | en_US |
| dc.contributor.researchID | 10794549 - Terblanche, Stephanus Esias | |
| dc.contributor.researchID | 10170758 - Hattingh, Johannes Michiel | |
