An exterior simplex type algorithm for the minimum cost network flow problem (Q958451)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An exterior simplex type algorithm for the minimum cost network flow problem |
scientific article; zbMATH DE number 5377412
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exterior simplex type algorithm for the minimum cost network flow problem |
scientific article; zbMATH DE number 5377412 |
Statements
An exterior simplex type algorithm for the minimum cost network flow problem (English)
0 references
4 December 2008
0 references
combinatorial optimization
0 references
minimum cost network flow problem
0 references
simplex algorithm
0 references
exterior point algorithm
0 references
0.9131965637207032
0 references
0.902888834476471
0 references
0.7915667295455933
0 references
