A polynomial dual simplex algorithm fot the generalized circulation problem. (Q5957566)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1717671
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial dual simplex algorithm fot the generalized circulation problem. |
scientific article; zbMATH DE number 1717671 |
Statements
A polynomial dual simplex algorithm fot the generalized circulation problem. (English)
0 references
2002
0 references
network flows
0 references
generalized circulation
0 references
generalized maximum flow
0 references
arc excess
0 references
excess scaling
0 references
0.8648943901062012
0 references
0.8393722772598267
0 references
0.8388562202453613
0 references
0.8343218564987183
0 references
0.8317469358444214
0 references
