Hybrid column generation and large neighborhood search for the dial-a-ride problem (Q339608): Difference between revisions

@@ Property / cites work @@
+The dial-a-ride problem: Models and algorithms
@@ Property / cites work: The dial-a-ride problem: Models and algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search for the dial-a-ride problem
+Normal rank
@@ Property / cites work @@
+A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
+Normal rank
@@ Property / cites work @@
+Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
+Normal rank
@@ Property / cites work @@
+The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
+Normal rank
@@ Property / cites work @@
+Handbook of metaheuristics
@@ Property / cites work: Handbook of metaheuristics / rank @@
+Normal rank
@@ Property / cites work @@
+A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
+Normal rank
@@ Property / cites work @@
+Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search
@@ Property / cites work: Variable neighborhood search / rank @@
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search: Principles and applications
+Normal rank
@@ Property / cites work @@
+A unified heuristic for a large class of vehicle routing problems with backhauls
+Normal rank