Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem (Q1707079): Difference between revisions

@@ Property / author @@
-Angel Corberán
@@ Property / author: Angel Corberán / rank @@
-Normal rank
@@ Property / author @@
-José María Sanchis
@@ Property / author: José María Sanchis / rank @@
-Normal rank
@@ Property / author @@
+Angel Corberán
@@ Property / author: Angel Corberán / rank @@
+Normal rank
@@ Property / author @@
+José María Sanchis
@@ Property / author: José María Sanchis / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2212020139
@@ Property / OpenAlex ID: W2212020139 / rank @@
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for the profitable windy rural postman problem
+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 @@
+Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network
+Normal rank
@@ Property / cites work @@
+Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems
+Normal rank
@@ Property / cites work @@
+The Covering Tour Problem
@@ Property / cites work: The Covering Tour Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Multi-Terminal Network Flows
@@ Property / cites work: Multi-Terminal Network Flows / rank @@
+Normal rank
@@ Property / cites work @@
+Solving the close-enough arc routing problem
@@ Property / cites work: Solving the close-enough arc routing problem / rank @@
+Normal rank