Two level general variable neighborhood search for attractive traveling salesman problem (Q337241): Difference between revisions

@@ Property / author @@
+Nenad Mladenović
@@ Property / author: Nenad Mladenović / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B06
@@ Property / Mathematics Subject Classification ID: 90B06 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C27
@@ Property / Mathematics Subject Classification ID: 90C27 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C59
@@ Property / Mathematics Subject Classification ID: 90C59 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6650757
@@ Property / zbMATH DE Number: 6650757 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+traveling salesman problem
@@ Property / zbMATH Keywords: traveling salesman problem / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+demand attraction
@@ Property / zbMATH Keywords: demand attraction / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+demand allocation
@@ Property / zbMATH Keywords: demand allocation / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+variable neighborhood search
@@ Property / zbMATH Keywords: variable neighborhood search / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+-level GVNS
@@ Property / zbMATH Keywords: 2-level GVNS / rank @@
+Normal rank

Revision as of 05:23, 28 June 2023