Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem (Q835755)
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 5600113
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem |
scientific article; zbMATH DE number 5600113 |
Statements
Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem (English)
0 references
31 August 2009
0 references
fixed-charge transportation problem
0 references
min-knapsack problem
0 references
greedy algorithms
0 references
worst-case analysis
0 references
approximation algorithms
0 references
0.8453236818313599
0 references
0.7958776950836182
0 references
0.7940071225166321
0 references
0.7615146040916443
0 references
0.753826379776001
0 references
