Reachability cuts for the vehicle routing problem with time windows (Q2432846): Difference between revisions

@@ Property / cites work @@
+Computational investigations of maximum flow algorithms
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
+Normal rank
@@ Property / cites work @@
+The precedence-constrained asymmetric traveling salesman polytope
+Normal rank
@@ Property / cites work @@
+A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the maximum clique problem
@@ Property / cites work: An exact algorithm for the maximum clique problem / rank @@
+Normal rank
@@ Property / cites work @@
+A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
+Normal rank
@@ Property / cites work @@
+A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems
+Normal rank
@@ Property / cites work @@
+-Path Cuts for the Vehicle Routing Problem with Time Windows
+Normal rank
@@ Property / cites work @@
+Projection results for vehicle routing
@@ Property / cites work: Projection results for vehicle routing / rank @@
+Normal rank
@@ Property / cites work @@
+A new branch-and-cut algorithm for the capacitated vehicle routing problem
+Normal rank
@@ Property / cites work @@
+Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
+Normal rank