BROWSE
Detail
Journal Article
Design of Local Networks using USHRs
Cited 7 time in 
Share 
Share
- Authors
- Donghan Kang, Kyungsik Lee, Sungsoo Park, Kyungchul Park, Sang-baeg Kim
- Issue Date
- 2000-08
- Citation
- Telecommunication Systems, v.14, no.1-4, pp.197-217
- ISSN
- 1018-4864
- Publisher
- Springer
- Language
- English
- Type
- Journal Article
- Abstract
- We consider the problem of designing a local network in a two-level telecommunication network. Given one or two hub nodes, central offices (COs) and conduits, the problem is to find a set of unidirectional self-healing rings (USHRs) which covers all COs and satisfies all demands at minimum cost. The solution approach used is the decomposition and column generation. Master problem and subproblem are modeled as integer programming models. After the optimal solution to linear programming relaxation of the master problem is obtained, a branch-and-bound algorithm is used to get an integer solution. A set of valid inequalities for a subproblem is given and a branch-and-cut algorithm is used to find an optimal solution to the subproblem. Computational results using real data are reported. © J.C. Baltzer AG, Science Publishers.
- KSP Keywords
- Branch-and-bound algorithm, Integer Programming, Linear programming relaxation, Local networks, Master problem, Minimum cost, Optimal Solution, Programming models, Real data, Telecommunication Network, Two-level