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

Fingerprint

Hub Location
Lagrangian Relaxation
Location Problem
Relaxation Scheme
Branch-and-cut
Telecommunication systems
advanced technology
Large-scale Problems
telecommunication
Telecommunications
Graph in graph theory
Model
services
Hub location
Location problem
Lagrangian relaxation
Graph

Keywords

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

ASJC Scopus subject areas

  • Geography, Planning and Development
  • 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: Location Science, Vol. 4, No. 3, 01.01.1996, p. 185-194.

Research output: Contribution to journalArticle

@article{9f055a408495473c8ff551efaf2ea2dc,
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 = "1996",
month = "1",
day = "1",
doi = "10.1016/S0966-8349(96)00009-5",
language = "English",
volume = "4",
pages = "185--194",
journal = "Computers and Operations Research",
issn = "0305-0548",
publisher = "Elsevier Limited",
number = "3",

}

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

Y1 - 1996/1/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=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

VL - 4

SP - 185

EP - 194

JO - Computers and Operations Research

JF - Computers and Operations Research

SN - 0305-0548

IS - 3

ER -