Dong X. Shaw

	1998
4		Dong X. Shaw, Geon Cho: The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem. Networks 31(4): 205-216 (1998)
	1997
3		Geon Cho, Dong X. Shaw, Seong-Lyun Kim: An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks. Computers & OR 24(8): 737-748 (1997)
2		Geon Cho, Dong X. Shaw: A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem. INFORMS Journal on Computing 9(4): 431-438 (1997)
1		Dong X. Shaw, Geon Cho, Hsuliang Chang: A depth-first dynamic programming procedure for the extended tree knapsack problem in local access network design. Telecommunication Systems 7(1-3): 29-43 (1997)

Coauthor Index

1	Hsuliang Chang	[1]
2	Geon Cho	[1] [2] [3] [4]
3	Seong-Lyun Kim	[3]