An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems (Q6087567): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.22082 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3214555511 / rank | |||
Normal rank | |||
Revision as of 09:43, 30 July 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
