Article ID: | iaor20051116 |
Country: | Netherlands |
Volume: | 25 |
Issue: | 3 |
Start Page Number: | 119 |
End Page Number: | 129 |
Publication Date: | Oct 1999 |
Journal: | Operations Research Letters |
Authors: | Labb Martine, Maffioli Francesco, Dell'Amico Mauro |
In this paper we address the problem of planning the capacity of the local rings in synchronous optical networks (SONET). We present efficient lower and upper bound procedures and a branch and bound algorithm which is able to find the exact solution of large instances, employing short computing times.