Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications (Q973008): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00453-008-9248-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2093067798 / rank | |||
Normal rank | |||
Revision as of 02:02, 20 March 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
