A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem (Q3260928): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:51, 4 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem |
scientific article |
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
