Minimum-cost dynamic flows: The series-parallel case (Q4474291): 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.1002/net.10112 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2066074485 / rank | |||
Normal rank | |||
Revision as of 00:22, 20 March 2024
scientific article; zbMATH DE number 2081223
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum-cost dynamic flows: The series-parallel case |
scientific article; zbMATH DE number 2081223 |
Statements
Minimum-cost dynamic flows: The series-parallel case (English)
0 references
4 August 2004
0 references
minimum-cost flow
0 references
dynamic network flow
0 references
greedy algorithm
0 references
two-terminal series parallel networks
0 references
