Combinatorial algorithms for fast clock mesh optimization
Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
Strong Formulations for 2-Node-Connected Steiner Network Problems
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
HM '08 Proceedings of the 5th International Workshop on Hybrid Metaheuristics
A new ILP formulation for 2-root-connected prize-collecting Steiner networks
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Minimizing network cost in all-optical networks
ANTS'09 Proceedings of the 3rd international conference on Advanced networks and telecommunication systems
Combinatorial algorithms for fast clock mesh optimization
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Improved formulations for the ring spur assignment problem
INOC'11 Proceedings of the 5th international conference on Network optimization
Lexicographical minimization of routing hops in telecommunication networks
INOC'11 Proceedings of the 5th international conference on Network optimization
Designing Steiner Networks with Unicyclic Connected Components: An Easy Problem
SIAM Journal on Discrete Mathematics
Solving survivable two-layer network design problems by metric inequalities
Computational Optimization and Applications
ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part II
The k-path tree matroid and its applications to survivable network design
Discrete Optimization
The k edge-disjoint 3-hop-constrained paths polytope
Discrete Optimization
Models and algorithms for robust network design with several traffic scenarios
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Benders Decomposition for the Hop-Constrained Survivable Network Design Problem
INFORMS Journal on Computing
Using GRASP for designing a layered network: a real IP/MPLS over DWDM application case
International Journal of Metaheuristics
Fractional routing using pairs of failure-disjoint paths
Discrete Applied Mathematics
Unreliable point facility location problems on networks
Discrete Applied Mathematics
| Hi-index | 0.00 |
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