GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem (Q336743): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C27
@@ Property / Mathematics Subject Classification ID: 90C27 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+-04
@@ Property / Mathematics Subject Classification ID: 90-04 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C35
@@ Property / Mathematics Subject Classification ID: 90C35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C59
@@ Property / Mathematics Subject Classification ID: 90C59 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6650554
@@ Property / zbMATH DE Number: 6650554 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+combinatorial optimization
@@ Property / zbMATH Keywords: combinatorial optimization / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+clustered traveling salesman problem
@@ Property / zbMATH Keywords: clustered traveling salesman problem / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+heuristics
@@ Property / zbMATH Keywords: heuristics / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+path relinking
@@ Property / zbMATH Keywords: path relinking / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+GRASP
@@ Property / zbMATH Keywords: GRASP / rank @@
+Normal rank

Revision as of 05:17, 28 June 2023