Improved formulations for the ring spur assignment problem
INOC'11 Proceedings of the 5th international conference on Network optimization
Using a hybrid honey bees mating optimisation algorithm for solving SONET/SDH design problems
Proceedings of the 4th International Symposium on Applied Sciences in Biomedical and Communication Technologies
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the solution of a graph partitioning problem under capacity constraints
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
In this article we consider the SONET ring assignment problem (SRAP) presented in [7]. The authors pointed out the inadequacy of solving SRAP instances using their integer programming formulation and commercial linear programming solvers. Similar experiences with IP models for SRAP are reported in [1]. In this article we reformulate SRAP as a set partitioning model with an additional knapsack constraint. This new formulation has an exponential number of columns and, to solve it, we implemented a branch-and-price/column generation algorithm. Extensive computational experiments showed that the new algorithm is orders of magnitude faster than standard branch-and-bound codes running on compact IP models introduced earlier. Instances taken from [1,7], which could not be solved there in hours of computation were solved here to optimality in just a few seconds. © 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 47(3), 157–171 2006