Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem (Q918425): Difference between revisions

@@ Property / cites work @@
+Optimization by Simulated Annealing
@@ Property / cites work: Optimization by Simulated Annealing / rank @@
+Normal rank
@@ Property / cites work @@
+Q4354785
@@ Property / cites work: Q4354785 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3677509
@@ Property / cites work: Q3677509 / rank @@
+Normal rank
@@ Property / cites work @@
+A man-machine approach toward solving the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+An Effective Heuristic Algorithm for the Traveling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+The traveling salesman problem: An update of research
+Normal rank
@@ Property / cites work @@
+Optimization of a 532-city symmetric traveling salesman problem by branch and cut
+Normal rank
@@ Property / cites work @@
+The Traveling-Salesman Problem and Minimum Spanning Trees
+Normal rank
@@ Property / cites work @@
+Q3996398
@@ Property / cites work: Q3996398 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf02022093
+Normal rank
@@ Property / OpenAlex ID @@
+W2123608273
@@ Property / OpenAlex ID: W2123608273 / rank @@
+Normal rank