A new subtour elimination constraint for the vehicle routing problem (Q1278251): Difference between revisions

@@ Property / author @@
-Q181175
@@ Property / author: Q181175 / rank @@
-Normal rank
@@ Property / author @@
-Q187866
@@ Property / author: Q187866 / rank @@
-Normal rank
@@ Property / author @@
+Louis Caccetta
@@ Property / author: Louis Caccetta / rank @@
+Normal rank
@@ Property / author @@
+Stephen P. Hill
@@ Property / author: Stephen P. Hill / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+CPLEX
@@ Property / describes a project that uses: CPLEX / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+VRP
@@ Property / describes a project that uses: VRP / 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/0377-2217(94)00332-7
+Normal rank
@@ Property / OpenAlex ID @@
+W1968665498
@@ Property / OpenAlex ID: W1968665498 / rank @@
+Normal rank
@@ Property / cites work @@
+Integer linear programming formulation for a vehicle routing problem
+Normal rank
@@ Property / cites work @@
+A set‐partitioning‐based exact algorithm for the vehicle routing problem
+Normal rank
@@ Property / cites work @@
+Q3688098
@@ Property / cites work: Q3688098 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
+Normal rank
@@ Property / cites work @@
+The traveling salesman problem: An overview of exact and approximate algorithms
+Normal rank
@@ Property / cites work @@
+A Branch and Bound Algorithm for a Class of Asymmetrical Vehicle Routeing Problems
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the asymmetrical capacitated vehicle routing problem
+Normal rank
@@ Property / cites work @@
+Q3751354
@@ Property / cites work: Q3751354 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Routing under Capacity and Distance Restrictions
+Normal rank