Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method (Q828198): Difference between revisions

@@ Property / DOI @@
-.1515/dma-2020-0028
@@ Property / DOI: 10.1515/dma-2020-0028 / rank @@
-Normal rank
@@ 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.1515/dma-2020-0028
+Normal rank
@@ Property / OpenAlex ID @@
+W3097297855
@@ Property / OpenAlex ID: W3097297855 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4821303
@@ Property / cites work: Q4821303 / rank @@
+Normal rank
@@ Property / cites work @@
+On the best choice of a branching variable in the subset sum problem
+Normal rank
@@ Property / cites work @@
+Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem
+Normal rank
@@ Property / cites work @@
+Tight Bounds for On-Line Tree Embeddings
@@ Property / cites work: Tight Bounds for On-Line Tree Embeddings / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic parallel backtrack search
@@ Property / cites work: Deterministic parallel backtrack search / rank @@
+Normal rank
@@ Property / cites work @@
+Randomized parallel algorithms for backtrack search and branch-and-bound computation
+Normal rank
@@ Property / DOI @@
+.1515/DMA-2020-0028
@@ Property / DOI: 10.1515/DMA-2020-0028 / rank @@
+Normal rank