Journal
NETWORKS
Volume 46, Issue 1, Pages 1-21Publisher
WILEY
DOI: 10.1002/net.20072
Keywords
survivable network; heuristic; polyhedral approach; hop-constraint
Ask authors/readers for more resources
For the past few decades, combinatorial optimization techniques have been shown to be powerful tools for formulating and solving optimization problems arising from practical situations. In particular, many network design problems have been formulated as combinatorial optimization problems. With the advances of optical technologies and the explosive growth of the Internet, telecommunication networks have seen an important evolution and therefore designing survivable networks has become a major objective for telecommunication operators. Over the past years, much research has been carried out to devise efficient methods for survivable network models, and particularly cutting plane based algorithms. In this paper, we attempt to survey some of these models and the optimization methods used for solving them. (c) 2005 Wiley Periodicals, Inc.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available