A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems (Q1194853): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+A parallel shortest augmenting path algorithm for the assignment problem
+Normal rank
@@ Property / cites work @@
+Q5591849
@@ Property / cites work: Q5591849 / rank @@
+Normal rank
@@ Property / cites work @@
+Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Primal-dual algorithms for the assignment problem
@@ Property / cites work: Primal-dual algorithms for the assignment problem / rank @@
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An Additive Bounding Procedure for Combinatorial Optimization Problems
+Normal rank
@@ Property / cites work @@
+Q3318088
@@ Property / cites work: Q3318088 / rank @@
+Normal rank
@@ Property / cites work @@
+A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q3221759
@@ Property / cites work: Q3221759 / rank @@
+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 @@
+A note on anomalies in parallel branch-and-bound algorithms with one-to- one bounding functions
+Normal rank
@@ Property / cites work @@
+Q5187226
@@ Property / cites work: Q5187226 / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm for the Traveling Salesman Problem
@@ Property / cites work: An Algorithm for the Traveling Salesman Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3751373
@@ Property / cites work: Q3751373 / 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 @@
+Optimization of a 532-city symmetric traveling salesman problem by branch and cut
+Normal rank
@@ Property / cites work @@
+Some Examples of Difficult Traveling Salesman Problems
+Normal rank
@@ Property / cites work @@
+Branch-and-bound and parallel computation: A historical note
+Normal rank
@@ Property / cites work @@
+Q3777451
@@ Property / cites work: Q3777451 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3707420
@@ Property / cites work: Q3707420 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01581188
+Normal rank
@@ Property / OpenAlex ID @@
+W1974443370
@@ Property / OpenAlex ID: W1974443370 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1194853