A hub location problem in designing digital data service networks: Lagrangian relaxation approach

Citations

SCOPUS

40

초록

This paper develops a graph-based model and a Lagrangian relaxation scheme to find a provably good solution for the problem of designing Digital Data Service (DDS) Networks described earlier in Lee et al. (Telecommunications Systems, 2, 261-274, 1994; Working paper, West Advanced Technologies, 1994). The new model and solution procedure reported in this paper can solve large-scale problems that are intractable to the branch-and-cut algorithm developed in the previous papers. © 1997 Elsevier Science Ltd. All rights reserved.

키워드

Hub location; Lagrangian relaxation; Network topology design; Steiner tree
제목
A hub location problem in designing digital data service networks: Lagrangian relaxation approach
저자
Lee, Youngho; Lim, Byung Ha; Park, June S.
DOI
10.1016/S0966-8349(96)00009-5
발행일
1996
유형
Article
저널명
Location Science
권
4
호
3
페이지
185 ~ 194