Where are the hard knapsack problems? (Q1772862): Difference between revisions

@@ Property / cites work @@
+New trends in exact algorithms for the \(0-1\) knapsack problem
+Normal rank
@@ Property / cites work @@
+Q4821303
@@ Property / cites work: Q4821303 / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial Linear Search Algorithm for the             <i>n</i>             -Dimensional Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Q4542570
@@ Property / cites work: Q4542570 / 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 @@
+A New Algorithm for the 0-1 Knapsack Problem
@@ Property / cites work: A New Algorithm for the 0-1 Knapsack Problem / rank @@
+Normal rank
@@ Property / cites work @@
+An expanding-core algorithm for the exact \(0-1\) knapsack problem
+Normal rank
@@ Property / cites work @@
+Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
+Normal rank
@@ Property / cites work @@
+Q3241581
@@ Property / cites work: Q3241581 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic programming on the word RAM
@@ Property / cites work: Dynamic programming on the word RAM / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Time Algorithms for Knapsack Problems with Bounded Weights
+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 @@
+Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank
@@ Property / cites work @@
+Core Problems in Knapsack Algorithms
@@ Property / cites work: Core Problems in Knapsack Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+On the \(0/1\) knapsack polytope
@@ Property / cites work: On the \(0/1\) knapsack polytope / rank @@
+Normal rank