The incorporation of an efficient initialization method and parameter adaptation using self-organizing maps to solve the TSP (Q2369122): Difference between revisions

@@ Property / cites work @@
+The Euclidean traveling salesman problem is NP-complete
+Normal rank
@@ Property / cites work @@
+``Neural'' computation of decisions in optimization problems
+Normal rank
@@ Property / cites work @@
+Competition-based neural network for the multiple travelling salesmen problem with minmax objective
+Normal rank
@@ Property / cites work @@
+A study of the application of Kohonen-type neural networks to the travelling salesman problem
+Normal rank
@@ Property / cites work @@
+Solving a combinatorial problem via self-organizing process: An application of the Kohonen algorithm to the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Self-organizing maps.
@@ Property / cites work: Self-organizing maps. / rank @@
+Normal rank
@@ Property / cites work @@
+The Guilty net for the traveling salesman problem
@@ Property / cites work: The Guilty net for the traveling salesman problem / rank @@
+Normal rank