Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems (Q545533): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10479-010-0730-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2041507489 / rank | |||
Normal rank | |||
Revision as of 00:39, 20 March 2024
scientific article
| 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 |
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
