On different approximation criteria for subset product problems (Q1076608): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(85)90061-4
+Normal rank
@@ Property / OpenAlex ID @@
+W1977674079
@@ Property / OpenAlex ID: W1977674079 / rank @@
+Normal rank
@@ Property / cites work @@
+Toward a unified approach for the classification of NP-complete optimization problems
+Normal rank
@@ Property / cites work @@
+Q3923601
@@ Property / cites work: Q3923601 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
+Normal rank
@@ Property / cites work @@
+Q3912008
@@ Property / cites work: Q3912008 / rank @@
+Normal rank
@@ Property / cites work @@
+Non deterministic polynomial optimization problems and their approximations
+Normal rank
@@ Property / cites work @@
+Approximate Algorithms for the 0/1 Knapsack Problem
+Normal rank