A strongly polynomial FPTAS for the symmetric quadratic knapsack problem (Q439504): 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.1016/j.ejor.2011.10.049 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2020203251 / rank | |||
Normal rank | |||
Revision as of 23:02, 19 March 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
