Pages that link to "Item:Q800816"
From MaRDI portal
The following pages link to Polynomial testing of the query ''Is \(a^ b\geq c^ d?''\) with application to finding a minimal cost reliability ratio spanning tree (Q800816):
Displaying 6 items.
- Element perturbation problems of optimum spanning trees with two-parameter objectives (Q674298) (← links)
- A fully polynomial time approximation scheme for minimum cost-reliability ratio problems (Q1183334) (← links)
- On the complexity and approximation of the maximum expected value all-or-nothing subset (Q2192058) (← links)
- A global optimization algorithm for solving the minimum multiple ratio spanning tree problem (Q2392120) (← links)
- On minimal cost-reliability ratio spanning trees and related problems (Q2564303) (← links)
- A Fourth bibliography of fractional programming (Q4327876) (← links)
