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 |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.4153/cjm-1957-024-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2044437461 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:39, 30 July 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
