A fully polynomial time approximation scheme for minimum cost-reliability ratio problems
From MaRDI portal
Reliability, availability, maintenance, inspection in operations research (90B25) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60)
Recommendations
- An \(\varepsilon\)-approximation scheme for combinatorial optimization problems with minimum variance criterion
- Approximation of linear fractional-multiplicative problems
- scientific article; zbMATH DE number 1263176
- On minimal cost-reliability ratio spanning trees and related problems
- Combinatorial optimization with rational objective functions
Cites work
- scientific article; zbMATH DE number 3561452 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 3302125 (Why is no real title available?)
- A Stochastic Programming Model
- A note on two problems in connexion with graphs
- A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program
- A polynomial time algorithm for a chance-constrained single machine scheduling problem
- C-programming problems: A class of non-linear optimization problems
- C-programming. An outline
- Combinatorial Optimization with Rational Objective Functions
- MINIMUM SPANNING TREE WITH NORMAL VARIATES AS WEIGHTS
- Maximizing Classes of Two-Parameter Objectives Over Matroids
- Minimal Cost-Reliability Ratio Spanning Tree
- Minimal ratio spanning trees
- Minimum cost-reliability ratio path problem
- On Nonlinear Fractional Programming
- On Some Properties of Programming Problems in Parametric form Pertaining to Fractional Programming
- Polynomial testing of the query Is \(a^ b\geq c^ d?\) with application to finding a minimal cost reliability ratio spanning tree
- Ratio dynamic programs
- Stochastic spanning tree problem
- VARIANCE CONSTRAINED MARKOV DECISION PROCESS
Cited in
(5)- On the complexity and approximation of the maximum expected value all-or-nothing subset
- Maximum probabilistic all-or-nothing paths
- A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem
- A branch and bound algorithm for designing reliable systems at a minimum cost
- Approximating a class of combinatorial problems with rational objective function
This page was built for publication: A fully polynomial time approximation scheme for minimum cost-reliability ratio problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1183334)
