TY - JOUR
T1 - A hub location problem in designing digital data service networks
T2 - Lagrangian relaxation approach
AU - Lee, Youngho
AU - Lim, Byung Ha
AU - Park, June S.
PY - 1996
Y1 - 1996
N2 - 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.
AB - 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.
KW - Hub location
KW - Lagrangian relaxation
KW - Network topology design
KW - Steiner tree
UR - http://www.scopus.com/inward/record.url?scp=0141752096&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0141752096&partnerID=8YFLogxK
U2 - 10.1016/S0966-8349(96)00009-5
DO - 10.1016/S0966-8349(96)00009-5
M3 - Article
AN - SCOPUS:0141752096
SN - 0305-0548
VL - 4
SP - 185
EP - 194
JO - Computers and Operations Research
JF - Computers and Operations Research
IS - 3
ER -