Geon Cho, Dong X. Shaw A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem. [Citation Graph (0, 0)][DBLP] INFORMS Journal on Computing, 1997, v:9, n:4, pp:431-438 [Journal]

Dong X. Shaw, Geon Cho The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem. [Citation Graph (0, 0)][DBLP] Networks, 1998, v:31, n:4, pp:205-216 [Journal]

Dong X. Shaw, Geon Cho, Hsuliang Chang A depth-first dynamic programming procedure for the extended tree knapsack problem in local access network design. [Citation Graph (0, 0)][DBLP] Telecommunication Systems, 1997, v:7, n:1-3, pp:29-43 [Journal]

Search in 0.001secs, Finished in 0.001secs

NOTICE1

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2

The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP