Abstract
The Extended Tree Knapsack Problem (ETKP) is a generalized version of the Tree Knapsack Problem where an arbitrary nonlinear traffic‐flow cost is imposed. This problem can be solved by the straight‐forward “bottom‐up” approach with a time complexity of O(nH 2), where n is the number of nodes in the tree, and H is the knapsack capacity. In this paper, we show that if the traffic‐flow cost function is the cable expansion cost, which occurs in the Local Access Telecommunication Network (LATN) expansion, this special ETKP can be solved by a depth‐first dynamic programming procedure in a time complexity of O(nδH), where δ is the largest existing cable capacity in LATN. This result indicates that the depth‐first dynamic programming algorithm can be applied for solving a general class of tree optimization problems. The computational results of our algorithm for the ETKP are also provided.
Similar content being viewed by others
References
A. Balakrishnan, T.L. Magnanti, A. Shulman and R.T. Wong, Models for planning capacity expansion in local access telecommunication networks, Annals of Operations Research 33 (1991) 239–284.
A. Balakrishnan, T.L. Magnanti and R.T. Wong, A decomposition algorithm for expanding local access telecommunication networks, Manuscript, Sloan School of Management, MIT, Cambridge, MA (1991).
D. Bienstock, A lot-sizing problem on trees, related to network design, Mathematics of Operations Research 18 (1993) 402–422.
D. Bienstock, Computational experience with an effective heuristic for some capacity expansion problems in local access networks, Telecommunication Systems 1 (1993) 379–400.
G. Cho and D. Shaw, A depth-first dynamic programming procedure for tree knapsack problem, Technical Report, School of Industrial Engineering, Purdue University, West Lafayette, IN (1994).
W. Cook, Integer programming solutions for capacity expansion of the local access network, Manuscript, Bell Communication Research (1990).
G. Cornuejols, G.L. Nemhauser and L.A. Wolsey, The uncapacitated facility location problem, in: Discrete Location Theory, eds. P.B. Mirchandani and R.L. Francis (Wiley, New York, 1990).
O.H. Ibarra and C.E. Kim, Approximation algorithms for certain scheduling problems, Mathematics of Operations Research 3 (1978) 197–204.
D.S. Johnson and K.A. Niemi, On knapsacks, partitions and a new dynamic programming technique for trees, Mathematics of Operations Research 8 (1983) 1–14.
O. Kariv and S.L. Hakimi, An algorithmic approach to network location problems II: The p-medians, SIAM J. Appl. Math. 37 (1979) 539–555.
A. Kolen and A. Tamir, Covering problems, in: Discrete Location Theory, eds. P.B. Mirchandani and R.L. Francis (Wiley, New York, 1990).
J.A. Lukes, Efficient algorithm for the partitioning of trees, IBM J. Research and Development 18 (1974) 214–224.
T.L. Magnanti and L.A. Wolsey, Optimal trees, in: Handbook in Operations Research and Management Sciences, series volume entitled Networks.
D. Shaw and G. Cho, Limited column generation for local access telecommunication network design - formulation, algorithms, and implementation, Technical Report, School of Industrial Engineering, Purdue University West Lafayette, IN (1995).
D. Shaw, Reformulation and column generation for several telecommunication network design problems, in: Proceedings of the 2nd International Telecommunication Conference, Nashville, TN (1994) 506–525.
D. Shaw and A. Wagelmans, An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs, Technical Report, Econometric Institute, Erasmus University, Rotterdam, The Netherlands (1995).
D. Shaw, Local access network design and its extension, Technical Report, School of Industrial Engineering, Purdue University, West Lafayette, IN (1995).
D. Shaw and G. Cho, A branch-and-bound procedure for the tree knapsack problem, Technical Report, School of Industrial Engineering, Purdue University, West Lafayette, IN (1994).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Shaw, D.X., Cho, G. & Chang, H. A depth‐first dynamic programming procedure for the extended tree knapsack problem in local access network design. Telecommunication Systems 7, 29–43 (1997). https://doi.org/10.1023/A:1019103824623
Issue Date:
DOI: https://doi.org/10.1023/A:1019103824623