An exact algorithm for the subset sum problem (Q5955091): Difference between revisions

@@ Property / cites work @@
+Hard Knapsack Problems
@@ Property / cites work: Hard Knapsack Problems / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm for Large Zero-One Knapsack Problems
@@ Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for the solution of the 0-1 knapsack problem
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for Knapsack Problems
+Normal rank
@@ Property / cites work @@
+Q4002255
@@ Property / cites work: Q4002255 / rank @@
+Normal rank
@@ Property / cites work @@
+A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank
@@ Property / cites work @@
+A Minimal Algorithm for the 0-1 Knapsack Problem
@@ Property / cites work: A Minimal Algorithm for the 0-1 Knapsack Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4247440
@@ Property / cites work: Q4247440 / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial approximation scheme for the subset sum problem
+Normal rank
@@ Property / cites work @@
+The bounded subset sum problem is almost everywhere randomly decidable in O(n)
+Normal rank