Implementation of parallel branch-and-bound algorithms --- experiences with the graph partitioning problem (Q1179744): Difference between revisions

@@ Property / cites work @@
+A new approach to the maximum-flow problem
@@ Property / cites work: A new approach to the maximum-flow problem / rank @@
+Normal rank
@@ Property / cites work @@
+An Efficient Heuristic Procedure for Partitioning Graphs
+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 @@
+Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Minimum cuts and related problems
@@ Property / cites work: Minimum cuts and related problems / rank @@
+Normal rank
@@ Property / cites work @@
+A parallel branch and bound algorithm for the quadratic assignment problem
+Normal rank
@@ Property / cites work @@
+Problème de la bipartition minimale d'un graphe
@@ Property / cites work: Problème de la bipartition minimale d'un graphe / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf02073939
+Normal rank
@@ Property / OpenAlex ID @@
+W2049205750
@@ Property / OpenAlex ID: W2049205750 / rank @@
+Normal rank