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

Youngho Lee, Byung Ha Lim, June S. Park

Research output: Contribution to journalArticle

31 Citations (Scopus)

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 languageEnglish
Pages (from-to)185-194
Number of pages10
JournalLocation Science
Volume4
Issue number3
DOIs
Publication statusPublished - 1996 Jan 1
Externally publishedYes

Keywords

  • Hub location
  • Lagrangian relaxation
  • Network topology design
  • Steiner tree

ASJC Scopus subject areas

  • Geography, Planning and Development
  • Transportation

Fingerprint Dive into the research topics of 'A hub location problem in designing digital data service networks: Lagrangian relaxation approach'. Together they form a unique fingerprint.

  • Cite this