On minimal cost-reliability ratio spanning trees and related problems

DOI10.1016/0167-6377(96)00014-4zbMath0865.90127OpenAlexW2061322750MaRDI QIDQ2564303

Lih-Hsing Hsu, Yung-Cheng Chang

Publication date: 7 January 1997

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(96)00014-4

zbMATH Keywords

minimal cost-reliability ratio spanning tree problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (1)

A fifth bibliography of fractional programming^*

Cites Work

• Unnamed Item
• Polynomial testing of the query Is \(a^ b\geq c^ d?\) with application to finding a minimal cost reliability ratio spanning tree
• Maximizing Classes of Two-Parameter Objectives Over Matroids
• Minimal Cost-Reliability Ratio Spanning Tree
• Minimal ratio spanning trees

This page was built for publication: On minimal cost-reliability ratio spanning trees and related problems