Efficient feasibility testing for dial-a-ride problems (Q1866982): Difference between revisions

@@ Property / cites work @@
+A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
+Normal rank
@@ Property / cites work @@
+k-interchange procedures for local search in a precedence-constrained routing problem
+Normal rank
@@ Property / cites work @@
+Scheduling Large-Scale Advance-Request Dial-A-Ride Systems
+Normal rank
@@ Property / cites work @@
+Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling
+Normal rank
@@ Property / cites work @@
+Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0167-6377(02)00120-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2040251648
@@ Property / OpenAlex ID: W2040251648 / rank @@
+Normal rank