A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases (Q420868): Difference between revisions

@@ Property / DOI @@
-.1016/j.ejor.2011.06.038
@@ Property / DOI: 10.1016/j.ejor.2011.06.038 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2011.06.038
+Normal rank
@@ Property / OpenAlex ID @@
+W2144013501
@@ Property / OpenAlex ID: W2144013501 / rank @@
+Normal rank
@@ Property / cites work @@
+Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
+Normal rank
@@ Property / cites work @@
+A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
+Normal rank
@@ Property / cites work @@
+Recent Models and Algorithms for One-to-One Pickup and Delivery Problems
+Normal rank
@@ 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 @@
+General solutions to the single vehicle routing problem with pickups and deliveries
+Normal rank
@@ Property / cites work @@
+A Dynamic Programming Approach to Sequencing Problems
+Normal rank
@@ Property / cites work @@
+The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
+Normal rank
@@ Property / cites work @@
+An algorithm for the traveling salesman problem with pickup and delivery customers
+Normal rank
@@ Property / cites work @@
+k-interchange procedures for local search in a precedence-constrained routing problem
+Normal rank
@@ Property / cites work @@
+The pickup and delivery problem: Faces and branch-and-cut algorithm
+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 / DOI @@
+.1016/J.EJOR.2011.06.038
@@ Property / DOI: 10.1016/J.EJOR.2011.06.038 / rank @@
+Normal rank