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

Youngho Lee; Byung Ha Lim; June S. Park

doi:10.1016/s0966-8349(96)00009-5

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

Youngho Lee^*
, Byung Ha Lim
, June S. Park

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English
Pages (from-to)	185-194
Number of pages	10
Journal	Recherche - Transports - Securite
Volume	62
DOIs	https://doi.org/10.1016/s0966-8349(96)00009-5
Publication status	Published - 1999

Keywords

Hub location
Lagrangian relaxation
Network topology design
Steiner tree

ASJC Scopus subject areas

Automotive Engineering
Transportation

Access to Document

10.1016/s0966-8349(96)00009-5

Cite this

@article{4f07f2c8220d4e149b92101216c6fd3e,

title = "A Hub location problem in designing digital data service networks: Lagrangian relaxation approach",

abstract = "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.",

keywords = "Hub location, Lagrangian relaxation, Network topology design, Steiner tree",

author = "Youngho Lee and Lim, \{Byung Ha\} and Park, \{June S.\}",

year = "1999",

doi = "10.1016/s0966-8349(96)00009-5",

language = "English",

volume = "62",

pages = "185--194",

journal = "Recherche - Transports - Securite",

issn = "0761-8980",

publisher = "Editions NecPlus",

}

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 - 1999

Y1 - 1999

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 - https://www.scopus.com/pages/publications/11144349174

U2 - 10.1016/s0966-8349(96)00009-5

DO - 10.1016/s0966-8349(96)00009-5

M3 - Article

AN - SCOPUS:11144349174

SN - 0761-8980

VL - 62

SP - 185

EP - 194

JO - Recherche - Transports - Securite

JF - Recherche - Transports - Securite

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this