A strongly polynomial FPTAS for the symmetric quadratic knapsack problem (Q439504): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C27 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68W25 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C60 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6066855 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
combinatorial optimization | |||
Property / zbMATH Keywords: combinatorial optimization / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
quadratic knapsack | |||
Property / zbMATH Keywords: quadratic knapsack / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
FPTAS | |||
Property / zbMATH Keywords: FPTAS / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
strongly polynomial time | |||
Property / zbMATH Keywords: strongly polynomial time / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
machine scheduling | |||
Property / zbMATH Keywords: machine scheduling / rank | |||
Normal rank |
Revision as of 01:44, 30 June 2023
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