Dual Algorithms for Pure Network Problems (Q3812008)
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 4081264
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dual Algorithms for Pure Network Problems |
scientific article; zbMATH DE number 4081264 |
Statements
Dual Algorithms for Pure Network Problems (English)
0 references
1989
0 references
dual algorithm
0 references
capacitated minimum cost network flow problem
0 references
dual reoptimization
0 references
implementation
0 references
cut-sets
0 references
assignment problems
0 references
transportation problems
0 references
transshipment problems
0 references
Computational testing
0 references
0.8518268465995789
0 references
0.8437796235084534
0 references
0.8256255388259888
0 references
