A note on anomalies in parallel branch-and-bound algorithms with one-to- one bounding functions (Q1107978): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(86)90109-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2091012988
@@ Property / OpenAlex ID: W2091012988 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3885184
@@ Property / cites work: Q3885184 / rank @@
+Normal rank
@@ Property / cites work @@
+Theoretical comparisons of search strategies in branch-and-bound algorithms
+Normal rank
@@ Property / cites work @@
+ON THE COMPUTATIONAL EFFICIENCY OF BRANCH-AND-BOUND ALGORITHMS
+Normal rank
@@ Property / cites work @@
+Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems
+Normal rank
@@ Property / cites work @@
+Anomalies in parallel branch-and-bound algorithms
@@ Property / cites work: Anomalies in parallel branch-and-bound algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Performance of parallel branch-and-bound algorithms
+Normal rank
@@ Property / cites work @@
+Random Trees and the Analysis of Branch and Bound Procedures
+Normal rank
@@ Property / cites work @@
+MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems
+Normal rank