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 within short computing times.
Exact Solution of the SONET Ring Loading Problem / Dell'Amico, Mauro; Maffioli, F.; Labbe', M.. - In: OPERATIONS RESEARCH LETTERS. - ISSN 0167-6377. - STAMPA. - 25:(1999), pp. 119-125.
Exact Solution of the SONET Ring Loading Problem
DELL'AMICO, Mauro;
1999-01-01
Abstract
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 within short computing times.
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
