Lower and upper bounds for the two-echelon capacitated location-routing problem (Q339668): 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.1016/j.cor.2012.04.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2165941447
@@ Property / OpenAlex ID: W2165941447 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q41763970
@@ Property / Wikidata QID: Q41763970 / rank @@
+Normal rank
@@ Property / cites work @@
+An Exact Method for the Capacitated Location-Routing Problem
+Normal rank
@@ Property / cites work @@
+A Branch-and-Cut method for the Capacitated Location-Routing Problem
+Normal rank
@@ Property / cites work @@
+An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
+Normal rank
@@ Property / cites work @@
+Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking
+Normal rank
@@ Property / cites work @@
+New Families of Valid Inequalities for the Two-Echelon Vehicle Routing Problem
+Normal rank
@@ Property / cites work @@
+A general heuristic for vehicle routing problems
@@ Property / cites work: A general heuristic for vehicle routing problems / rank @@
+Normal rank
@@ Property / cites work @@
+Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
+Normal rank
@@ Property / cites work @@
+Record breaking optimization results using the ruin and recreate principle
+Normal rank