Polynomial dual network simplex algorithms (Q689130): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01580615 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4294576787 / rank | |||
Normal rank | |||
Latest revision as of 08:23, 30 July 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
0 references
0 references
