A strongly polynomial FPTAS for the symmetric quadratic knapsack problem (Q439504): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 05:05, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A strongly polynomial FPTAS for the symmetric quadratic knapsack problem |
scientific article |
Statements
A strongly polynomial FPTAS for the symmetric quadratic knapsack problem (English)
0 references
16 August 2012
0 references
combinatorial optimization
0 references
quadratic knapsack
0 references
FPTAS
0 references
strongly polynomial time
0 references
machine scheduling
0 references