A combination of parallel machine scheduling and the covering problem (Q2928419)
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 6366711
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A combination of parallel machine scheduling and the covering problem |
scientific article; zbMATH DE number 6366711 |
Statements
7 November 2014
0 references
approximation algorithm
0 references
combination of optimization problems
0 references
covering problem
0 references
parallel machine scheduling
0 references
A combination of parallel machine scheduling and the covering problem (English)
0 references
0.8799371123313904
0 references
0.8668237328529358
0 references
0.822454571723938
0 references
0.8167000412940979
0 references