A fully polynomial time approximation scheme for minimum cost-reliability ratio problems
From MaRDI portal
Publication:1183334
DOI10.1016/0166-218X(92)90038-CzbMath0742.90032MaRDI QIDQ1183334
Publication date: 28 June 1992
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
90C60: Abstract computational complexity for mathematical programming problems
90B25: Reliability, availability, maintenance, inspection in operations research
90C27: Combinatorial optimization
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Ratio dynamic programs
- C-programming problems: A class of non-linear optimization problems
- Polynomial testing of the query Is \(a^ b\geq c^ d?\) with application to finding a minimal cost reliability ratio spanning tree
- C-programming. An outline
- Minimum cost-reliability ratio path problem
- Stochastic spanning tree problem
- 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
- VARIANCE CONSTRAINED MARKOV DECISION PROCESS
- Maximizing Classes of Two-Parameter Objectives Over Matroids
- Combinatorial Optimization with Rational Objective Functions
- MINIMUM SPANNING TREE WITH NORMAL VARIATES AS WEIGHTS
- Minimal Cost-Reliability Ratio Spanning Tree
- Minimal ratio spanning trees
- A Stochastic Programming Model
- On Some Properties of Programming Problems in Parametric form Pertaining to Fractional Programming
- On Nonlinear Fractional Programming
