An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems (Q6087567)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7775907
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.762532651424408
0 references
0.7594789266586304
0 references
0.7551823854446411
0 references
0.7329491972923279
0 references
0.7325013279914856
0 references
