New lower bound for the capacitated arc routing problem (Q2496046): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cor.2005.02.015
+Normal rank
@@ Property / OpenAlex ID @@
+W2076475865
@@ Property / OpenAlex ID: W2076475865 / rank @@
+Normal rank
@@ Property / cites work @@
+Capacitated arc routing problems
@@ Property / cites work: Capacitated arc routing problems / rank @@
+Normal rank
@@ Property / cites work @@
+Transforming arc routing into node routing problems
+Normal rank
@@ Property / cites work @@
+The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases
+Normal rank
@@ Property / cites work @@
+New lower bounds for the Capacitated Arc Routing Problem
+Normal rank
@@ Property / cites work @@
+The Capacitated Arc Routing Problem: Lower bounds
@@ Property / cites work: The Capacitated Arc Routing Problem: Lower bounds / rank @@
+Normal rank
@@ Property / cites work @@
+NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM
+Normal rank