New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem (Q3113511): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1002/net.20469
@@ Property / full work available at URL: https://doi.org/10.1002/net.20469 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2014159196
@@ Property / OpenAlex ID: W2014159196 / rank @@
+Normal rank
@@ Property / cites work @@
+A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem
+Normal rank
@@ Property / cites work @@
+The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases
+Normal rank
@@ Property / cites work @@
+Lower bounds and heuristics for the windy rural postman problem
+Normal rank
@@ Property / cites work @@
+Min-Max <i>K</i> -vehicles windy rural postman problem
+Normal rank
@@ Property / cites work @@
+A metaheuristic for the min-max windy rural postman problem with K vehicles
+Normal rank
@@ Property / cites work @@
+A cutting plane algorithm for the general routing problem
+Normal rank
@@ Property / cites work @@
+A branch &amp; cut algorithm for the windy general routing problem and special cases
+Normal rank
@@ Property / cites work @@
+The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
+Normal rank
@@ Property / cites work @@
+Solvable cases of the \(k\)-person Chinese postman problem
+Normal rank

New facets and an enhanced branch-and-cut for the min-max <i>K</i> -vehicles windy rural postman problem (Q3113511): Difference between revisions