Minimum-cost dynamic flows: The series-parallel case (Q4474291): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1002/net.10112 / rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
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 | |||
Property / cites work | |||
Property / cites work: Q4737515 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4471275 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4449191 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3128904 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1002/NET.10112 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 04:02, 30 December 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