The generalized arc routing problem (Q1688441): Difference between revisions

@@ Property / DOI @@
-.1007/s11750-017-0437-4
@@ Property / DOI: 10.1007/s11750-017-0437-4 / rank @@
-Normal rank
@@ 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.1007/s11750-017-0437-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2586457066
@@ Property / OpenAlex ID: W2586457066 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3159349
@@ Property / cites work: Q3159349 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving the prize-collecting rural postman problem
+Normal rank
@@ Property / cites work @@
+The generalized arc routing problem
@@ Property / cites work: The generalized arc routing problem / rank @@
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for the profitable windy rural postman problem
+Normal rank
@@ Property / cites work @@
+On the cycle polytope of a binary matroid
@@ Property / cites work: On the cycle polytope of a binary matroid / rank @@
+Normal rank
@@ Property / cites work @@
+The capacitated arc routing problem: Valid inequalities and facets
+Normal rank
@@ Property / cites work @@
+Lower bounds and heuristics for the windy rural postman problem
+Normal rank
@@ Property / cites work @@
+Q4762468
@@ Property / cites work: Q4762468 / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for the Rural Postman problem on a directed graph
+Normal rank
@@ Property / cites work @@
+A polyhedral approach to the rural postman problem
+Normal rank
@@ Property / cites work @@
+Arc Routing
@@ Property / cites work: Arc Routing / rank @@
+Normal rank
@@ Property / cites work @@
+A cutting plane algorithm for the general routing problem
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for the maximum benefit Chinese postman problem
+Normal rank
@@ Property / cites work @@
+Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
+Normal rank
@@ Property / cites work @@
+Odd Minimum Cut Sets and <i>b</i>-Matchings Revisited
+Normal rank
@@ Property / cites work @@
+Maximum matching and a polyhedron with 0,1-vertices
+Normal rank
@@ Property / cites work @@
+Improvement Procedures for the Undirected 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 @@
+A branch-and-cut algorithm for the undirected rural postman problem
+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
@@ Property / cites work @@
+A fundamental problem in vehicle routing
@@ Property / cites work: A fundamental problem in vehicle routing / rank @@
+Normal rank
@@ Property / cites work @@
+Odd Minimum Cut-Sets and <i>b</i>-Matchings
@@ Property / cites work: Odd Minimum Cut-Sets and <i>b</i>-Matchings / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S11750-017-0437-4
@@ Property / DOI: 10.1007/S11750-017-0437-4 / rank @@
+Normal rank