Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems (Q545533)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems |
scientific article; zbMATH DE number 5911475
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems |
scientific article; zbMATH DE number 5911475 |
Statements
Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems (English)
0 references
22 June 2011
0 references
maximum flows
0 references
robust minimum cuts
0 references
reoptimization heuristics
0 references
Goldberg-Tarjan algorithm
0 references
robust network optimization
0 references
incremental maximum flow algorithms
0 references
0 references
