The algorithm of finding all paradoxical pairs in a linear transportation problem (Q4903634)
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: The algorithm of finding all paradoxical pairs in a linear transportation problem |
scientific article; zbMATH DE number 6128407
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The algorithm of finding all paradoxical pairs in a linear transportation problem |
scientific article; zbMATH DE number 6128407 |
Statements
THE ALGORITHM OF FINDING ALL PARADOXICAL PAIRS IN A LINEAR TRANSPORTATION PROBLEM (English)
0 references
24 January 2013
0 references
transportation problem
0 references
paradoxical range of flow
0 references
0.8701516389846802
0 references
0.8576054573059082
0 references
0.8538469076156616
0 references
