Network Simplex Algorithm associated with the Maximum Flow Problem (Q6287829)
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 900318278
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Network Simplex Algorithm associated with the Maximum Flow Problem |
scientific article; zbMATH DE number 900318278 |
Statements
13 June 2017
0 references
