| Author | Cheng, Kuo-hsien |
| Call Number | AIT RSPR no. IE-84-3 |
| Subject(s) | Branch and bound algorithms
|
| Note | A research study submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Engineering and Technology |
| Publisher | Asian Institute of Technology |
| Abstract | 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. |
| Year | 1984 |
| Type | Research Study Project Report (RSPR) |
| School | School of Engineering and Technology |
| Department | Department of Industrial Systems Engineering (DISE) |
| Academic Program/FoS | Industrial Engineering (IE) |
| Chairperson(s) | Oudheusden, Dirk L. Van
|
| Examination Committee(s) | Clarke Harry R. ;Saeed, Khalid ;Kanchana Kanchanasut |
| Scholarship Donor(s) | BES Engineering Corporation
P.o.Box 335 Taipei, Taiwan
The Republic of China |
| Degree | Research Studies Project Report (M. Eng.) - Asian Institute of Technology, 1984 |