A strongly polynomial FPTAS for the symmetric quadratic knapsack problem (Q439504): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C27
@@ Property / Mathematics Subject Classification ID: 90C27 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B35
@@ Property / Mathematics Subject Classification ID: 90B35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W25
@@ Property / Mathematics Subject Classification ID: 68W25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C60
@@ Property / Mathematics Subject Classification ID: 90C60 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6066855
@@ 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 00:44, 30 June 2023