Minimum cost-reliability ratio path problem

DOI10.1016/0305-0548(88)90031-7MaRDI QIDQ1102209zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Minimum cost path problems with relays
• Algorithms for the quickest path problem and the reliable quickest path problem
• scientific article; zbMATH DE number 4202051
• Bi-criteria path problem with minimum length and maximum survival probability
• scientific article; zbMATH DE number 792650

Cites work

• scientific article; zbMATH DE number 3819489 (Why is no real title available?)
• scientific article; zbMATH DE number 3918092 (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?)
• scientific article; zbMATH DE number 3313421 (Why is no real title available?)
• Augmented Threaded Index Method For Network Optimization
• Combinatorial Optimization with Rational Objective Functions
• Linear multiobjective programming
• Minimal Cost-Reliability Ratio Spanning Tree
• Minimal ratio spanning trees
• Optimal expansion of capacitated transshipment networks
• Ratio dynamic programs

Cited in

(26)

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

This page was built for publication: Minimum cost-reliability ratio path problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102209)