Optimization based algorithms for finding minimal cost ring covers in survivable networks

Optimization based algorithms for finding minimal cost ring covers in survivable networks

0.00 Avg rating0 Votes
Article ID: iaor20003687
Country: Netherlands
Volume: 14
Issue: 2
Start Page Number: 219
End Page Number: 230
Publication Date: Sep 1999
Journal: Computational Optimization and Applications
Authors: , ,
Keywords: optimization, computational analysis
Abstract:

Designing low cost SONET networks composed of self-healing rings is an important problem facing the providers of broadband services. This manuscript demonstrates how optimization technology coupled with the highly efficient CPLEX software system can be used to help solve this important problem. For the first time, provable optimal designs are presented for several small networks which appear in the literature. In an empirical analysis, we demonstrate how this same methodology can be used to find good (but not provably optimal) designs for large test cases.

Reviews

Required fields are marked *. Your email address will not be published.