Worst case analysis of two heuristics for the set partitioning problem (Q3774940)
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 4035131
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Worst case analysis of two heuristics for the set partitioning problem |
scientific article; zbMATH DE number 4035131 |
Statements
Worst case analysis of two heuristics for the set partitioning problem (English)
0 references
1987
0 references
set partitioning problem
0 references
scheduling
0 references
0.8979325
0 references
0.8870921
0 references
0.88483125
0 references
0.8840895
0 references
0.87637264
0 references
0.8751637
0 references
0.8739886
0 references
0.87272096
0 references
