An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks

Geon Cho, Dong X. Shaw, Seong Lyun Kim

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

Given a rooted tree T with node profits and node demands, the capacitated subtree of a tree problem (CSTP) consists of finding a rooted subtree of the maximum profit, subject to having total demand no larger than the given capacity H. We first define the so-called critical item for CSTP and find upper bounds on the optimal value of CSTP in O(n2) time, where n is the number of nodes in T. We then present our branch-and-bound algorithm for solving CSTP and illustrate the algorithm by using an example. Finally, we implement our branch-and-bound algorithm by using one of the developed upper bounds and compare the computational results with those given by the branch-and-bound version of CPLEX and given by a dynamic programming algorithm for CSTP whose complexity is O(nH), The comparison shows that our branch-and-bound algorithm performs much better than both CPLEX and the dynamic programming algorithm, especially when n and H are large, for example, in the range of [50, 500] and [5000, 10,000], respectively.

Original languageEnglish
Pages (from-to)737-748
Number of pages12
JournalComputers and Operations Research
Volume24
Issue number8
DOIs
Publication statusPublished - 1997 Jan 1

Fingerprint

Telecommunication Network
Telecommunication networks
Efficient Algorithms
Branch and Bound Algorithm
Dynamic Programming
Profit
Dynamic programming
Vertex of a graph
Profitability
Upper bound
Rooted Trees
Branch-and-bound
Computational Results
Telecommunication network
Range of data
Branch and bound algorithm
Node

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Modelling and Simulation
  • Management Science and Operations Research

Cite this

@article{58e78f225d44410da5e62c310a28fced,
title = "An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks",
abstract = "Given a rooted tree T with node profits and node demands, the capacitated subtree of a tree problem (CSTP) consists of finding a rooted subtree of the maximum profit, subject to having total demand no larger than the given capacity H. We first define the so-called critical item for CSTP and find upper bounds on the optimal value of CSTP in O(n2) time, where n is the number of nodes in T. We then present our branch-and-bound algorithm for solving CSTP and illustrate the algorithm by using an example. Finally, we implement our branch-and-bound algorithm by using one of the developed upper bounds and compare the computational results with those given by the branch-and-bound version of CPLEX and given by a dynamic programming algorithm for CSTP whose complexity is O(nH), The comparison shows that our branch-and-bound algorithm performs much better than both CPLEX and the dynamic programming algorithm, especially when n and H are large, for example, in the range of [50, 500] and [5000, 10,000], respectively.",
author = "Geon Cho and Shaw, {Dong X.} and Kim, {Seong Lyun}",
year = "1997",
month = "1",
day = "1",
doi = "10.1016/S0305-0548(96)00091-3",
language = "English",
volume = "24",
pages = "737--748",
journal = "Surveys in Operations Research and Management Science",
issn = "0305-0548",
publisher = "Elsevier Limited",
number = "8",

}

An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks. / Cho, Geon; Shaw, Dong X.; Kim, Seong Lyun.

In: Computers and Operations Research, Vol. 24, No. 8, 01.01.1997, p. 737-748.

Research output: Contribution to journalArticle

TY - JOUR

T1 - An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks

AU - Cho, Geon

AU - Shaw, Dong X.

AU - Kim, Seong Lyun

PY - 1997/1/1

Y1 - 1997/1/1

N2 - Given a rooted tree T with node profits and node demands, the capacitated subtree of a tree problem (CSTP) consists of finding a rooted subtree of the maximum profit, subject to having total demand no larger than the given capacity H. We first define the so-called critical item for CSTP and find upper bounds on the optimal value of CSTP in O(n2) time, where n is the number of nodes in T. We then present our branch-and-bound algorithm for solving CSTP and illustrate the algorithm by using an example. Finally, we implement our branch-and-bound algorithm by using one of the developed upper bounds and compare the computational results with those given by the branch-and-bound version of CPLEX and given by a dynamic programming algorithm for CSTP whose complexity is O(nH), The comparison shows that our branch-and-bound algorithm performs much better than both CPLEX and the dynamic programming algorithm, especially when n and H are large, for example, in the range of [50, 500] and [5000, 10,000], respectively.

AB - Given a rooted tree T with node profits and node demands, the capacitated subtree of a tree problem (CSTP) consists of finding a rooted subtree of the maximum profit, subject to having total demand no larger than the given capacity H. We first define the so-called critical item for CSTP and find upper bounds on the optimal value of CSTP in O(n2) time, where n is the number of nodes in T. We then present our branch-and-bound algorithm for solving CSTP and illustrate the algorithm by using an example. Finally, we implement our branch-and-bound algorithm by using one of the developed upper bounds and compare the computational results with those given by the branch-and-bound version of CPLEX and given by a dynamic programming algorithm for CSTP whose complexity is O(nH), The comparison shows that our branch-and-bound algorithm performs much better than both CPLEX and the dynamic programming algorithm, especially when n and H are large, for example, in the range of [50, 500] and [5000, 10,000], respectively.

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

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

U2 - 10.1016/S0305-0548(96)00091-3

DO - 10.1016/S0305-0548(96)00091-3

M3 - Article

VL - 24

SP - 737

EP - 748

JO - Surveys in Operations Research and Management Science

JF - Surveys in Operations Research and Management Science

SN - 0305-0548

IS - 8

ER -