Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications (Q973008)
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 5713397
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications |
scientific article; zbMATH DE number 5713397 |
Statements
Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications (English)
0 references
28 May 2010
0 references
quadratic knapsack
0 references
single machine scheduling
0 references
total weighted completion time
0 references
availability constraints
0 references
scheduling agents
0 references
FPTAS
0 references
0 references
0 references
0.8983595371246338
0 references
0.8575984239578247
0 references
0.8317005038261414
0 references
