An efficient pruning algorithm for value independent knapsack problem using a DAG structure (Q1891244): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0305-0548(94)00025-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2048315099
@@ Property / OpenAlex ID: W2048315099 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Partitions with Applications to the Knapsack Problem
+Normal rank
@@ Property / cites work @@
+A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
+Normal rank
@@ Property / cites work @@
+A Parallel Algorithm for the Knapsack Problem
@@ Property / cites work: A Parallel Algorithm for the Knapsack Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A parallel time/hardware tradeoff T.H=O(2/sup n/2/) for the knapsack problem
+Normal rank
@@ Property / cites work @@
+A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
+Normal rank
@@ Property / cites work @@
+Merging and Sorting Applied to the Zero-One Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Technical Note—Solution of the Value-Independent Knapsack Problem by Partitioning
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1891244