Optimizing tabu list size for the traveling salesman problem (Q1265842): Difference between revisions

@@ Property / cites work @@
+Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Using tabu search techniques for graph coloring
@@ Property / cites work: Using tabu search techniques for graph coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Tabu Search—Part I
@@ Property / cites work: Tabu Search—Part I / rank @@
+Normal rank
@@ Property / cites work @@
+Future paths for integer programming and links to artificial intelligence
+Normal rank
@@ Property / cites work @@
+Q3994364
@@ Property / cites work: Q3994364 / rank @@
+Normal rank
@@ Property / cites work @@
+Computer Solutions of the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+An Effective Heuristic Algorithm for the Traveling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
+Normal rank
@@ Property / cites work @@
+Nonoptimal Edges for the Symmetric Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
+Normal rank
@@ Property / cites work @@
+The traveling-salesman problem and minimum spanning trees: Part II
+Normal rank
@@ Property / cites work @@
+The Traveling-Salesman Problem and Minimum Spanning Trees
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0305-0548(97)00030-0
+Normal rank
@@ Property / OpenAlex ID @@
+W1984641114
@@ Property / OpenAlex ID: W1984641114 / rank @@
+Normal rank