Maximum Reliability throught a Newtork with Resource Contraints

DOI10.2307/2582827zbMATH Open0574.90035OpenAlexW4242054969MaRDI QIDQ3693229FDOQ3693229

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)

Cited In (5)

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

   Recommendations

• Maximum probability shortest path problem 👍 👎
• Title not available (Why is that?) 👍 👎
• Probabilistic shortest path problems with budgetary constraints 👍 👎
• A shortest path routing problem with resource allocation 👍 👎
• Maximum probabilistic all-or-nothing paths 👍 👎

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)