Minimum cost-reliability ratio path problem

DOI10.1016/0305-0548(88)90031-7zbMath0643.90088OpenAlexW1984044902MaRDI QIDQ1102209

Ravindra K. Ahuja

Publication date: 1988

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(88)90031-7

zbMATH Keywords

random networksgrid networksefficient extreme pointminimum cost-reliability ratio path problemmulticriteria shortest pathsparametric shortest pathsspecial ratio path problemtwo-parameter shortest path problemworst case computational complexity

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Sensitivity, stability, parametric optimization (90C31)

Related Items

The most critical path in a PERT network: A heuristic approach ⋮ Expanding maximum capacity path under weighted sum-type distances ⋮ Paths with minimum range and ratio of arc lengths ⋮ The balanced traveling salesman problem ⋮ A method to evaluate routing policy through \(p\) minimal paths for stochastic case ⋮ System reliability for quickest path problems under time threshold and budget ⋮ A Fourth bibliography of fractional programming ⋮ The quickest path problem ⋮ Constrained balanced optimization problems ⋮ Optimal paths in bi-attribute networks with fractional cost functions ⋮ Stochastic flow networks via multiple paths under time threshold and budget constraint ⋮ A fully polynomial time approximation scheme for minimum cost-reliability ratio problems ⋮ Algorithms for the quickest path problem and the enumeration of quickest paths ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks ⋮ On transmission time through \(k\) minimal paths of a capacitated-flow network ⋮ Maximum probabilistic all-or-nothing paths ⋮ On the quickest path problem ⋮ Time version of the shortest path problem in a stochastic-flow network ⋮ The quadratic balanced optimization problem ⋮ The multichannel quickest-path problem ⋮ Reliability evaluation of a multistate network subject to time constraint under routing policy ⋮ Algorithms for the constrained quickest path problem and the enumeration of quickest paths ⋮ Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network

Cites Work

• Ratio dynamic programs
• Linear multiobjective programming
• Optimal expansion of capacitated transshipment networks
• Combinatorial Optimization with Rational Objective Functions
• Minimal Cost-Reliability Ratio Spanning Tree
• Minimal ratio spanning trees
• Augmented Threaded Index Method For Network Optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item