A Cheng, Kuo-hsien creator Oudheusden, Dirk L. Van Chairperson Clarke Harry R. Examination Committee Saeed, Khalid Examinaton Committee Kanchana Kanchanasut Examination Committee BES Engineering Corporation P.o.Box 335 Taipei, Taiwan The Republic of China text series technical report th Bangkok Asian Institute of Technology 1984 continuing eng 46, xxx p A Special Purpose Algorithm for Solving The Weighted subtree Problem The Weighted Subtree Problem (WSP) is the selection of an optimal tree out of a given network such that total edge costs are lower than a given budget value. Optimality refers to the overall utility of the subtree ; this utility is the sum of the utilities of the included vertices. Solution techniques for WSP are heuristic or make us e of integer programming. In this study a special purpose algorithm of the branch and bound type is developed. Its performance is tested on computer and comparisons are mad e with a heuristic approach. A research study submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Engineering and Technology Research Studies Project Report (M. Eng.) - Asian Institute of Technology, 1984 Branch and bound algorithms Asian Institute of Technology. http://203.159.5.9/ait-thesis/detail.php?q=B20734 http://203.159.5.9/ait-thesis/detail.php?q=B20734 121095 20260818221927.0