| dc.contributor.author | Agarwal, Y. K. | |
| dc.contributor.author | Venkateshan, Prahalad | |
| dc.date.accessioned | 2016-01-05T04:30:44Z | |
| dc.date.available | 2016-01-05T04:30:44Z | |
| dc.date.copyright | 2014 | |
| dc.date.issued | 2014 | |
| dc.identifier.citation | Agarwal, Y. K., & Venkateshan, P. (2014). Survivable network design with shared-protection routing. European Journal of Operational Research, 238(3), 836-845. | en_US |
| dc.identifier.uri | http://hdl.handle.net/11718/17230 | |
| dc.description.abstract | In this paper we study the problem of designing a survivable telecommunication network with shared-protection routing. We develop a heuristic algorithm to solve this problem. Recent results in the area of global re-routing have been used to obtain very tight lower bounds for the problem. Our results indicate that in a majority of problem instances, the average gap between the heuristic solutions and the lower bounds is within 5%. Computational experience is reported on randomly generated problem instances with up to 35 nodes, 80 edges and 595 demand pairs and also on the instances available in SNDlib database. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Elsevier | en_US |
| dc.subject | Shared protection survivable network design | en_US |
| dc.subject | End-to-end restoration schemes | en_US |
| dc.subject | Column generation | en_US |
| dc.subject | Large scale optimization | en_US |
| dc.title | Survivable network design with shared-protection routing | en_US |
| dc.type | Article | en_US |
