Polynomial dual network simplex algorithms (Q689130): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57318276, #quickstatements; #temporary_batch_1705506869772 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:27, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial dual network simplex algorithms |
scientific article |
Statements
Polynomial dual network simplex algorithms (English)
0 references
6 December 1993
0 references
minimum cost network flows
0 references
strongly polynomial capacity scaling algorithms
0 references
transshipment problem
0 references
polynomial dual network simplex pivot rule
0 references
