Exact solution of the SONET Ring Loading Problem

被引：24

作者：

Dell'Amico, M

Labbé, M

Maffioli, F

机构：

[1] Univ Modena & Reggio Emilia, Dipartimento Sci & Metodi Ingn, I-42100 Reggio Emilia, Italy

[2] Free Univ Brussels, Inst Stat & Rech Operat, B-1050 Brussels, Belgium

[3] Free Univ Brussels, Serv Math Gest, B-1050 Brussels, Belgium

[4] Politecn Milan, Dipartimento Elettron & Informaz, I-20133 Milan, Italy

来源：

OPERATIONS RESEARCH LETTERS | 1999年 / 25卷 / 03期

关键词：

communication; programming; linear algorithm; integer; branch and bound;

D O I：

10.1016/S0167-6377(99)00031-0

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

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. (C) 1999 Elsevier Science B.V. All rights reserved.

引用

页码：119 / 129

页数：11

共 5 条

[1] AN OPTIMIZATION PROBLEM RELATED TO BALANCING LOADS ON SONET RINGS
COSARES, S
SANIEE, I
[J]. TELECOMMUNICATION SYSTEMS, 1994, 3 (02) : 165 - 181
[2] ALGORITHMS FOR ROUTING AROUND A RECTANGLE
FRANK, A
NISHIZEKI, T
SAITO, N
SUZUKI, H
TARDOS, E
[J]. DISCRETE APPLIED MATHEMATICS, 1992, 40 (03) : 363 - 378
[3] MARTELLO S, 1992, KNAPSACK PROBLEMS AL
[4] The ring loading problem
Schrijver, A
Seymour, P
Winkler, P
[J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 1998, 11 (01) : 1 - 14
[5] Vachani R., 1996, INFORMS Journal on Computing, V8, P235, DOI 10.1287/ijoc.8.3.235

← 1 →