A variable neighborhood search for solving the multi-vehicle covering tour problem (Q2631288): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.endm.2014.11.037
+Normal rank
@@ Property / OpenAlex ID @@
+W2094675202
@@ Property / OpenAlex ID: W2094675202 / rank @@
+Normal rank
@@ Property / cites work @@
+The Covering Salesman Problem
@@ Property / cites work: The Covering Salesman Problem / rank @@
+Normal rank
@@ Property / cites work @@
+The Covering Tour Problem
@@ Property / cites work: The Covering Tour Problem / rank @@
+Normal rank
@@ Property / cites work @@
+An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices
+Normal rank
@@ Property / cites work @@
+Heuristics for the multi-vehicle covering tour problem
+Normal rank
@@ Property / cites work @@
+Variable neighbourhood search: methods and applications
+Normal rank
@@ Property / cites work @@
+The vehicle routing problem: An overview of exact and approximate algorithms
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search
@@ Property / cites work: Variable neighborhood search / rank @@
+Normal rank