A computational comparison of flow formulations for the capacitated location-routing problem (Q1799384): Difference between revisions

@@ Property / describes a project that uses @@
+CVRPSP
@@ Property / describes a project that uses: CVRPSP / 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.1016/j.disopt.2013.07.005
+Normal rank
@@ Property / OpenAlex ID @@
+W1970402125
@@ Property / OpenAlex ID: W1970402125 / rank @@
+Normal rank
@@ Property / cites work @@
+A Branch-and-Cut method for the Capacitated Location-Routing Problem
+Normal rank
@@ Property / cites work @@
+An Exact Method for the Capacitated Location-Routing Problem
+Normal rank
@@ Property / cites work @@
+A heuristic solution to the warehouse location-routing problem
+Normal rank
@@ Property / cites work @@
+Heuristic solutions to multi-depot location-routing problems
+Normal rank
@@ Property / cites work @@
+A two-phase tabu search approach to the location routing problem
+Normal rank
@@ Property / cites work @@
+Symmetry in Integer Linear Programming
@@ Property / cites work: Symmetry in Integer Linear Programming / rank @@
+Normal rank
@@ Property / cites work @@
+An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
+Normal rank
@@ Property / cites work @@
+Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
+Normal rank
@@ Property / cites work @@
+A result on projection for the vehicle routing problem
+Normal rank
@@ Property / cites work @@
+A new branch-and-cut algorithm for the capacitated vehicle routing problem
+Normal rank
@@ Property / cites work @@
+Edmonds polytopes and weakly hamiltonian graphs
@@ Property / cites work: Edmonds polytopes and weakly hamiltonian graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the symmetric travelling salesman problem I: Inequalities
+Normal rank
@@ Property / cites work @@
+Q5184698
@@ Property / cites work: Q5184698 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Easy and difficult objective functions for max cut
+Normal rank
@@ Property / cites work @@
+Multi-Terminal Network Flows
@@ Property / cites work: Multi-Terminal Network Flows / rank @@
+Normal rank
@@ Property / cites work @@
+Robust branch-and-cut-and-price for the capacitated vehicle routing problem
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
+Normal rank
@@ Property / cites work @@
+An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
+Normal rank
@@ Property / cites work @@
+Improved lower bounds and exact algorithm for the capacitated arc routing problem
+Normal rank