Dynamic programming algorithms for the zero-one knapsack problem (Q1138485): Difference between revisions

@@ Property / cites work @@
+Merging and Sorting Applied to the Zero-One Knapsack Problem
+Normal rank
@@ Property / cites work @@
+A Branch Search Algorithm for the Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Computing Partitions with Applications to the Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Reduction Algorithm for Zero-One Single Knapsack Problems
+Normal rank
@@ Property / cites work @@
+When the Greedy Solution Solves a Class of Knapsack Problems
+Normal rank
@@ Property / cites work @@
+An upper bound for the zero-one knapsack problem and a branch and bound algorithm
+Normal rank
@@ Property / cites work @@
+Q4197626
@@ Property / cites work: Q4197626 / rank @@
+Normal rank
@@ Property / cites work @@
+Branch-and-Bound Strategies for Dynamic Programming
+Normal rank
@@ Property / cites work @@
+An Efficient Algorithm for the 0-1 Knapsack Problem
+Normal rank
@@ Property / cites work @@
+A Direct Descent Binary Knapsack Algorithm
@@ Property / cites work: A Direct Descent Binary Knapsack Algorithm / rank @@
+Normal rank