Preprocessing to reduce vehicle capacity for routing problems (Q6097441): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s43069-023-00220-9
+Normal rank
@@ Property / OpenAlex ID @@
+W4376610667
@@ Property / OpenAlex ID: W4376610667 / rank @@
+Normal rank
@@ Property / cites work @@
+Vehicle Routing
@@ Property / cites work: Vehicle Routing / rank @@
+Normal rank
@@ Property / cites work @@
+Robust branch-and-cut-and-price for the capacitated vehicle routing problem
+Normal rank
@@ Property / cites work @@
+Improved branch-cut-and-price for capacitated vehicle routing
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Technical Note—Solution of the Value-Independent Knapsack Problem by Partitioning
+Normal rank
@@ Property / cites work @@
+Q3751354
@@ Property / cites work: Q3751354 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of the separation problem for rounded capacity inequalities
+Normal rank
@@ Property / cites work @@
+A new branch-and-cut algorithm for the capacitated vehicle routing problem
+Normal rank
@@ Property / cites work @@
+Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
+Normal rank
@@ Property / cites work @@
+New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
+Normal rank
@@ Property / cites work @@
+Q3048611
@@ Property / cites work: Q3048611 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
+Normal rank
@@ Property / cites work @@
+Probabilistic diversification and intensification in local search for vehicle routing
+Normal rank
@@ Property / cites work @@
+New benchmark instances for the capacitated vehicle routing problem
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:6097441