Journal of the Korean Operations Research and Management Science Society (한국경영과학회지)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

A Branch and Bound Algorithm for Solving a Capacitated Subtree of Tree Problem in Local Access Telecommunication Networks

  • Cho, Geon (School of Business Administration, Chonnam National University) ;
  • Kim, Seong-Lyun (Electronics and Telecommunication Research Institute)
  • Published : 1997.09.01
Download PDF
⟨ Previous Next ⟩

Abstract

Given a rooted tree T with profits and node demands, the capacitated subtree of a tree problem (GSTP) consists of finding a rooted subtree of 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 an upper bound on the optimal value of CSTP in O(n$^{2}$) time, where n is the number of nodes in T. We then present our branch and bound algorithm for solving CSTP and illustrate the algiruthm by using an example. Finally, we implement our branch-and-bound algorithm and compare the computational results with those for both CPLEX and a dynamic programming algorithm. The comparison shows that our branch-and-bound algorithm performs much better than both CPLEX and the dynamic programming algorithm, where n and H are the range of [50, 500] and [5000, 10000], respectively.

Keywords

References

  1. Technical Report, Center for Operations Research & Econometrics Optimizing Constrained Subtrees of Trees Aghezzaf, E.H.;T.L. Magnanti;L.A. Wolsey
  2. Operations Research v.43 A Decomposition Algorithm for Expanding Local Access Telecommunications Networks Balakrishnan, A.;T.L. Magnanti;R.T. Wong
  3. Operations Research v.28 An Algorithm for Large Zero-One Knapsack Problem Balas, E.;E. Zemel
  4. Technical Report, School of Industrial Engineering A Depth-First Dynamic Programming Algorithm for The Tree Knapsack Problem Cho, G.;D.X. Shaw
  5. J. of the ACM v.21 Computing Partitions with Applications to The Knapsack Problem Horowitz, E.;S. Sahni
  6. Mathematics of Operations Research v.3 Approximation Algorithms for Certain Scheduling Problems Ibarra, O.H.;C.E. Kim
  7. Mathematics of Operations Research v.8 On Knapsacks, Partitions, and A New Dynamic Programming Technique for Trees Johnson, D.S.;K.A. Niemi
  8. SIAM J. on Applied Mathematics v.37 An Algorithmic Approach to Network Location Problems Ⅱ : The p-medians Kariv, O.;S.L. Hakimi
  9. Mathematics of Operations Research v.4 Fast Approximation Algorithms for Knapsack Problems Lawler, E.L.
  10. Handbooks in OR and MS v.7 Chapter 9. Optimal Trees Magnanti, T.L.;L.A. Wolsey
  11. Annals of Discrete Mathematics v.31 Algorithms for Knapsack Problems Martello, S.;P. Toth
  12. Knapsack Problems Martello, S.;P. Toth
  13. Discrete Location Theory Mirchandani, P.B.;R.L. Francis
  14. Integer and Combinatorial Optimization Nemhauser, G.L.;L.A. Wolsey
  15. Technical Report, School of Industrial Engineering Limited Column Generation Technique for Several Telecommunications Network Design Problems D.X. Shaw