A strongly polynomial FPTAS for the symmetric quadratic knapsack problem (Q439504)
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: A strongly polynomial FPTAS for the symmetric quadratic knapsack problem |
scientific article; zbMATH DE number 6066855
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A strongly polynomial FPTAS for the symmetric quadratic knapsack problem |
scientific article; zbMATH DE number 6066855 |
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
0 references
0 references
0 references
0 references
0.8983595371246338
0 references
0.8696208000183105
0 references
0.772606372833252
0 references
0.7715345025062561
0 references
