Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem (Q2806992): Difference between revisions

@@ 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/978-3-319-28697-6_70
+Normal rank
@@ Property / OpenAlex ID @@
+W2575431039
@@ Property / OpenAlex ID: W2575431039 / rank @@
+Normal rank
@@ Property / cites work @@
+New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
+Normal rank
@@ Property / cites work @@
+The capacitated arc routing problem: Valid inequalities and facets
+Normal rank
@@ Property / cites work @@
+A cutting plane algorithm 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 @@
+Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
+Normal rank
@@ Property / cites work @@
+Capacitated arc routing problems
@@ Property / cites work: Capacitated arc routing problems / rank @@
+Normal rank
@@ Property / cites work @@
+The Shortest-Path Problem with  Resource Constraints and <i>k</i>-Cycle Elimination for <i>k</i> ≥ 3
+Normal rank
@@ Property / cites work @@
+Exploiting sparsity in pricing routines for the capacitated arc routing problem
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2806992