Maximum Reliability throught a Newtork with Resource Contraints

DOI10.2307/2582827MaRDI QIDQ3693229zbMATH OpenOpenAlexFDO

Authors N. G. F. Sancho

Publication date 1985

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2582827

zbMATH Keywords

reliabilityresource allocationbest pathhighest overall probability

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Reliability, availability, maintenance, inspection in operations research (90B25) Dynamic programming (90C39)

Recommendations

• Maximum probability shortest path problem
• scientific article; zbMATH DE number 4204086
• Probabilistic shortest path problems with budgetary constraints
• A shortest path routing problem with resource allocation
• Maximum probabilistic all-or-nothing paths

Cited in

(6)

• Network reliability design via joint probabilistic constraints
• Optimally reliable networks
• Computing and maximizing the exact reliability of wireless backhaul networks
• Optimal distribution of reliability for a large network based on connectivity
• A functional equation for finding the largest expected capacity of a graph
• Reliability-constrained dimensioning of transmission resources in packet-switched networks

This page was built for publication: Maximum Reliability throught a Newtork with Resource Contraints

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