Reductions between scheduling problems with non-renewable resources and knapsack problems (Q482287)
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: Reductions between scheduling problems with non-renewable resources and knapsack problems |
scientific article; zbMATH DE number 6382138
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reductions between scheduling problems with non-renewable resources and knapsack problems |
scientific article; zbMATH DE number 6382138 |
Statements
Reductions between scheduling problems with non-renewable resources and knapsack problems (English)
0 references
22 December 2014
0 references
approximation preserving reductions
0 references
scheduling problems
0 references
knapsack problems
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7905095219612122
0 references
0.7823752760887146
0 references
0.7813881635665894
0 references
0.7746458053588867
0 references
0.7699880003929138
0 references
