Cheng, Kuo-hsien <br/><br/>
A special purpose algorithm for solving the weighted subtree problem 

 - Bangkok :  Asian Institute of Technology,  1984 
 - 46, xxx p 
 - Research studies project report ;  no. IE-84-3 .
 - Asian Institute of Technology.  Research studies project report ;  no. IE-84-3 .
<br/><br/> A research study submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Engineering and Technology 
<br/><br/>Research Studies Project Report (M. Eng.) - Asian Institute of Technology, 1984 
<br/><br/> 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. 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Branch and bound algorithms