论文信息 - Exact solution of the SONET Ring Loading Problem

Exact solution of the SONET Ring Loading Problem

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.

[1] Peter Winkler,et al. The Ring Loading Problem , 1998, SIAM Rev..

[2] Peter Kubat,et al. Multicommodity Flows in Ring Networks , 1996, INFORMS J. Comput..

[3] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[4] Nobuji Saito,et al. Algorithms for Routing around a Rectangle , 1992, Discret. Appl. Math..

[5] Iraj Saniee,et al. An optimization problem related to balancing loads on SONET rings , 1994, Telecommun. Syst..