Article ID: | iaor1998332 |
Country: | Netherlands |
Volume: | 19 |
Issue: | 3 |
Start Page Number: | 65 |
End Page Number: | 69 |
Publication Date: | Aug 1996 |
Journal: | Operations Research Letters |
Authors: | Hsu Lih-Hsing, Chang Yung-Cheng |
Keywords: | networks |
The minimal cost-reliability ratio spanning tree problem is to find a spanning tree such that the cost-reliability ratio is minimized. This problem can also be treated a a specific version of a more generalized problem discussed by Hassin and Tamir. By Hassin and Tamir’s approach, the minimal cost-reliability ratio spanning tree problem can be solved in O(