A polynomial time primal network simplex algorithm for minimum cost flows (Q1373741): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57318274, #quickstatements; #temporary_batch_1705817641484 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:13, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial time primal network simplex algorithm for minimum cost flows |
scientific article |
Statements
A polynomial time primal network simplex algorithm for minimum cost flows (English)
0 references
25 November 1997
0 references
polynomial time primal network simplex algorithm
0 references
mininium cost flow
0 references
