An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems (Q6087567): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1002/net.22082 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/NET.22082 / rank | |||
Normal rank | |||
Latest revision as of 18:19, 30 December 2024
scientific article; zbMATH DE number 7775907
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems |
scientific article; zbMATH DE number 7775907 |
Statements
An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems (English)
0 references
12 December 2023
0 references
linear programming
0 references
maximum flow problem
0 references
network optimization
0 references
node capacities
0 references
0 references
0 references
