Pages that link to "Item:Q1183334"
From MaRDI portal
The following pages link to A fully polynomial time approximation scheme for minimum cost-reliability ratio problems (Q1183334):
Displaying 6 items.
- An \(\varepsilon\)-approximation scheme for combinatorial optimization problems with minimum variance criterion (Q1183333) (← links)
- On the complexity and approximation of the maximum expected value all-or-nothing subset (Q2192058) (← links)
- Maximum probabilistic all-or-nothing paths (Q2286936) (← links)
- Approximating a class of combinatorial problems with rational objective function (Q2638374) (← links)
- A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem (Q4268894) (← links)
- A branch and bound algorithm for designing reliable systems at a minimum cost (Q5931708) (← links)
