A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem (Q3260928)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem |
scientific article; zbMATH DE number 3144061
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem |
scientific article; zbMATH DE number 3144061 |
Statements
A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem (English)
0 references
1957
0 references
mathematical biology, operations research
0 references
