Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications (Q973008): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Knapsack / rank | |||
Normal rank | |||
Revision as of 05:09, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications |
scientific article |
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
