Fast augmentation algorithms for maximising the output flow in repairable flow networks after edge failures (Q5172471): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximum flow in probabilistic graphs-the discrete case / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximal Flow Through a Network / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new approach to the maximum-flow problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: MC-based algorithm for a telecommunication network under node and budget constraints / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints / rank | |||
Normal rank | |||
Latest revision as of 16:19, 9 July 2024
scientific article; zbMATH DE number 6397067
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast augmentation algorithms for maximising the output flow in repairable flow networks after edge failures |
scientific article; zbMATH DE number 6397067 |
Statements
Fast augmentation algorithms for maximising the output flow in repairable flow networks after edge failures (English)
0 references
4 February 2015
0 references
repairable flow networks
0 references
fast reoptimisation algorithm
0 references
edge failure
0 references
topology
0 references
performance
0 references
maximising throughput flow
0 references
