Fast augmentation algorithms for maximising the output flow in repairable flow networks after edge failures
From MaRDI portal
Publication:5172471
DOI10.1080/00207721.2012.670294zbMath1312.90016OpenAlexW1978599279MaRDI QIDQ5172471
Publication date: 4 February 2015
Published in: International Journal of Systems Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207721.2012.670294
performancetopologyrepairable flow networksedge failurefast reoptimisation algorithmmaximising throughput flow
Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)
Related Items (2)
Discrete-time model for a motion of substance in a channel of a network with application to channels of human migration ⋮ Statistical distributions connected to motion of substance in a channel of a network
Cites Work
- Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints
- MC-based algorithm for a telecommunication network under node and budget constraints
- Maximal Flow Through a Network
- A new approach to the maximum-flow problem
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Maximum flow in probabilistic graphs-the discrete case
This page was built for publication: Fast augmentation algorithms for maximising the output flow in repairable flow networks after edge failures
