2005/06/13 by Hervé Kerivin, A. Ridha Mahjoub · 1 citation
Engineering · Computer Science · Mathematics · #Advanced Optical Network Technologies #Advanced Graph Theory Research #Vehicle Routing Optimization Methods #Computer science #Combinatorial optimization #Optimization problem #Telecommunications network #Network planning and design #Mathematical optimization #Operations research #Management science #Computer network #Engineering #Mathematics #Algorithm
paper · doi:10.1002/net.20072
openalex publication_date 2005/06/13 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/22
Abstract 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. © 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 46(1), 1–21 2005