AI SearchA special purpose algorithm for solving the weighted subtree problem
Call Number: AIT RSPR no. IE-84-3 Material type:
SeriesSeries: Asian Institute of Technology. Research studies project report ; no. IE-84-3Publication details: Bangkok : Asian Institute of Technology, 1984Description: 46, xxx pSubject(s): Online resources: Dissertation note: Research Studies Project Report (M. Eng.) - Asian Institute of Technology, 1984 Summary: 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.
| Cover image | Item type | Current library | Home library | Collection | Shelving location | Call number | Materials specified | Vol info | URL | Copy number | Status | Notes | Date due | Barcode | Item holds | Item hold queue priority | Course reserves | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
20-AIT Publication
|
Asian Institute of Technology Library AIT Publications | AIT RSPR no. IE-84-3 (Browse shelf(Opens below)) | 1 | Available | 30050002949518 | |||||||||||||
|
20-AIT Publication
|
Asian Institute of Technology Library AIT Publications | AIT RSPR no. IE-84-3 (Browse shelf(Opens below)) | 2 | Available | 30050003128534 | |||||||||||||
|
20-AIT Publication
|
Asian Institute of Technology Library Archives | AIT RSPR no. IE-84-3 (Browse shelf(Opens below)) | 3 | Available | 30050003128518 | |||||||||||||
|
20-AIT Publication
|
Asian Institute of Technology Library Archives | AIT RSPR no. IE-84-3 (Browse shelf(Opens below)) | 4 | Available | 30050003128526 | |||||||||||||
40-Archives
|
Asian Institute of Technology Library Archives | AIT RSPR no. IE-84-3 (Browse shelf(Opens below)) | 1 | Available | 30050160110085 |
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
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.
There are no comments on this title.