Minimal Cost-Reliability Ratio Spanning Tree
From MaRDI portal
Publication:3923967
DOI10.1016/S0304-0208(08)73457-1zbMath0469.90083MaRDI QIDQ3923967
R. Chandrasekaran, K. P. K. Nair, Yash P. Aneja
Publication date: 1981
Published in: North-Holland Mathematics Studies (Search for Journal in Brave)
networkpolynomial algorithmoptimal solutionindirect searchminimal cost-reliability ratio spanning tree
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Extremal problems in graph theory (05C35) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items
Minimum cost-reliability ratio path problem ⋮ A global optimization algorithm for solving the minimum multiple ratio spanning tree problem ⋮ An \(\varepsilon\)-approximation scheme for combinatorial optimization problems with minimum variance criterion ⋮ A fully polynomial time approximation scheme for minimum cost-reliability ratio problems ⋮ On minimal cost-reliability ratio spanning trees and related problems ⋮ Polynomial testing of the query Is \(a^ b\geq c^ d?\) with application to finding a minimal cost reliability ratio spanning tree
