The Profitable Arc Tour Problem: Solution with a Branch-and-Price Algorithm
Transportation Science
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |
Designing low cost SONET networks composed of self-healingrings is an important problem facing the providers of broadbandservices. This manuscript demonstrates how optimization technologycoupled with the highly efficient CPLEX software system can be usedto help solve this important problem. For the first time, provableoptimal designs are presented for several small networks which appearin the literature. In an empirical analysis, we demonstrate how thissame methodology can be used to find good (but not provablyoptimal) designs for large test cases.