A branch and bound algorithm for the capacitated vehicle routing problem (Q585095): Difference between revisions

@@ Property / cites work @@
+A restricted Lagrangean approach to the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Partitioning procedures for solving mixed-variables programming problems
+Normal rank
@@ Property / cites work @@
+Q4103312
@@ Property / cites work: Q4103312 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3048611
@@ Property / cites work: Q3048611 / 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 @@
+State-space relaxation procedures for the computation of bounds to routing problems
+Normal rank
@@ Property / cites work @@
+An Integer Programming Approach to the Vehicle Scheduling Problem
+Normal rank
@@ Property / cites work @@
+Applications of Linear Programming in the Oil Industry
+Normal rank
@@ Property / cites work @@
+Implementing vehicle routing algorithms
@@ Property / cites work: Implementing vehicle routing algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q5645210
@@ Property / cites work: Q5645210 / rank @@
+Normal rank
@@ Property / cites work @@
+On the symmetric travelling salesman problem: Solution of a 120-city problem
+Normal rank
@@ Property / cites work @@
+The traveling-salesman problem and minimum spanning trees: Part II
+Normal rank
@@ Property / cites work @@
+Q4404428
@@ Property / cites work: Q4404428 / rank @@
+Normal rank
@@ Property / cites work @@
+An exact algorithm for minimizing routing and operating costs in depot location
+Normal rank
@@ Property / cites work @@
+Two exact algorithms for the distance-constrained vehicle routing problem
+Normal rank
@@ Property / cites work @@
+Integer programming approaches to the travelling salesman problem
+Normal rank
@@ Property / cites work @@
+Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph
+Normal rank