论文信息 - A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem

A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem

The Tree Knapsack Problem (TKP) can be regarded as a 0--1 knapsack problem on a rooted tree T such that if a node is selected into a knapsack, then all nodes on the path from the selected node to the root node must also be selected into the knapsack. In this paper, we develop a pseudopolynomial-time algorithm for TKP, the depth-first dynamic programming algorithm. We prove that a TKP can be solved by our algorithm in (theta)( nH ) time, where n is the number of nodes in T and H is the given capacity. We also report the computational results of the depth-first dynamic programming algorithm.

Geon Cho | Dong X. Shaw

[1] Oscar H. Ibarra,et al. Approximation Algorithms for Certain Scheduling Problems , 1978, Math. Oper. Res..

[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3] Geon Cho,et al. A depth‐first dynamic programming procedure for the extended tree knapsack problem in local access network design , 1997, Telecommun. Syst..

[4] D. S. Johnson,et al. On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees , 1983, Math. Oper. Res..

[5] Thomas L. Magnanti,et al. A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning , 1995, Oper. Res..

[6] George L. Nemhauser,et al. The uncapacitated facility location problem , 1990 .

[7] O. Kariv,et al. An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[8] Daniel Bienstock. A Lot-Sizing Problem on Trees, Related to Network Design , 1993, Math. Oper. Res..

[9] Joseph A. Lukes. Efficient Algorithm for the Partitioning of Trees , 1974, IBM J. Res. Dev..