Minimal Cost-Reliability Ratio Spanning Tree

DOI10.1016/S0304-0208(08)73457-1MaRDI QIDQ3923967zbMATHFDO

Authors R. Chandrasekaran, K. P. K. Nair, Y. P. Aneja

Publication date 1981

Published in North-Holland Mathematics Studies (Search for Journal in Brave)

zbMATH Keywords

networkoptimal solutionpolynomial algorithmindirect searchminimal cost-reliability ratio spanning tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Reliability, availability, maintenance, inspection in operations research (90B25) Extremal problems in graph theory (05C35)

Cited in

(6)

• 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
• An \(\varepsilon\)-approximation scheme for combinatorial optimization problems with minimum variance criterion
• A fully polynomial time approximation scheme for minimum cost-reliability ratio problems
• A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
• Minimum cost-reliability ratio path problem

This page was built for publication: Minimal Cost-Reliability Ratio Spanning Tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3923967)