Routing through a network with maximum reliability

DOI10.1016/0022-247X(82)90197-4zbMath0491.90087MaRDI QIDQ1167668

Mohammad Roosta

Publication date: 1982

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

reliabilitycommunication networksstochastic networkresource constraintcomputation of solutionsmost reliable pathPollack's algorithmstochastic optimal path problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Stochastic programming (90C15) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)

Related Items (4)

On the Bellman's principle of optimality ⋮ Quantifying transient spreading dynamics on networks ⋮ A two‐stage network interdiction‐monitoring game ⋮ Routing problems and Markovian decision processes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a routing problem
• Onkth Best Policies
• Letter to the Editor—The kth Best Route Through a Network
• A Method for the Solution of the N th Best Path Problem
• Queueing Models for Computer Communications System Analysis
• An Appraisal of Some Shortest-Path Algorithms

This page was built for publication: Routing through a network with maximum reliability