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

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
JournalRecherche - Transports - Securite
Volume62
Publication statusPublished - 1999 Dec 1
Externally publishedYes

Fingerprint

Telecommunication systems
telecommunication

Keywords

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

ASJC Scopus subject areas

  • Automotive Engineering
  • Transportation

Cite this

A Hub location problem in designing digital data service networks : Lagrangian relaxation approach. / Lee, Youngho; Lim, Byung Ha; Park, June S.

In: Recherche - Transports - Securite, Vol. 62, 01.12.1999, p. 185-194.

Research output: Contribution to journalArticle

@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",
month = "12",
day = "1",
language = "English",
volume = "62",
pages = "185--194",
journal = "Recherche - Transports - Securite",
issn = "0761-8980",
publisher = "Elsevier BV",

}

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/12/1

Y1 - 1999/12/1

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=11144349174&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=11144349174&partnerID=8YFLogxK

M3 - Article

VL - 62

SP - 185

EP - 194

JO - Recherche - Transports - Securite

JF - Recherche - Transports - Securite

SN - 0761-8980

ER -