Solving the close-enough arc routing problem (Q2811327): Difference between revisions

@@ Property / DOI @@
-.1002/net.21525
@@ Property / DOI: 10.1002/net.21525 / rank @@
-Normal rank
@@ Property / cites work @@
+An algorithm for the Rural Postman problem on a directed graph
+Normal rank
@@ Property / cites work @@
+A computational study of several heuristics for the DRPP
+Normal rank
@@ Property / cites work @@
+The Covering Tour Problem
@@ Property / cites work: The Covering Tour Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristics for the multi-vehicle covering tour problem
+Normal rank
@@ Property / cites work @@
+Heuristic Approaches for a TSP Variant: The Automatic Meter Reading Shortest Tour Problem
+Normal rank
@@ Property / cites work @@
+On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
+Normal rank
@@ Property / cites work @@
+On the set covering polytope: Facets with coefficients in \(\{0,1,2,3\}\)
+Normal rank
@@ Property / cites work @@
+A comparison of two different formulations for arc routing problems on mixed graphs
+Normal rank
@@ Property / cites work @@
+A cutting plane algorithm for the general routing problem
+Normal rank
@@ Property / cites work @@
+Lower bounds and heuristics for the windy rural postman problem
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for the undirected rural postman problem
+Normal rank
@@ Property / DOI @@
+.1002/NET.21525
@@ Property / DOI: 10.1002/NET.21525 / rank @@
+Normal rank