An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks. - Geon Cho; Dong X. Shaw; Seong-Lyun Kim (Comput. Oper. Res., 1997)

A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem. - Geon Cho; Dong X. Shaw (INFORMS J. Comput., 1997)

A depth-first dynamic programming procedure for the extended tree knapsack problem in local access network design. - Dong X. Shaw; Geon Cho; Hsuliang Chang (Telecommun. Syst., 1997)

The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem. - Dong X. Shaw; Geon Cho (Networks, 1998)

An Optimal Decision Making Model for Supplier and Buyer's Win-Win Strategy in a Two Echelon Supply Chain. - Geon Cho; Soon-Hoo So; Jae Jon Kim; Yi Sook Park; Hyong Ho Park; Kyung Ho Jung; Choon-Sup Noh (HICSS, 2008)

The Continuous Service Usage Intention in the Web Analytics Services. - Jaesung Park; Kyung Ho Jung; Yunhee Lee; Geon Cho; Jae Jon Kim; Joon Koh (HICSS, 2009)