Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading (Q1046716): Difference between revisions

@@ Property / DOI @@
-.1016/j.cor.2009.08.003
@@ Property / DOI: 10.1016/j.cor.2009.08.003 / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+Algorithm 97
@@ Property / describes a project that uses: Algorithm 97 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cor.2009.08.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2033271291
@@ Property / OpenAlex ID: W2033271291 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q59222254
@@ Property / Wikidata QID: Q59222254 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3523238
@@ Property / cites work: Q3523238 / rank @@
+Normal rank
@@ Property / cites work @@
+The pickup and delivery traveling salesman problem with first-in-first-out loading
+Normal rank
@@ Property / cites work @@
+An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading
+Normal rank
@@ Property / cites work @@
+Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows
+Normal rank
@@ Property / cites work @@
+A new extension of local search applied to the Dial-A-Ride problem
+Normal rank
@@ Property / cites work @@
+A heuristic for the pickup and delivery traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Perturbation heuristics for the 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 @@
+The pickup and delivery problem: Faces and branch-and-cut algorithm
+Normal rank
@@ Property / cites work @@
+The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
+Normal rank
@@ Property / cites work @@
+Q5323551
@@ Property / cites work: Q5323551 / rank @@
+Normal rank
@@ Property / cites work @@
+Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
+Normal rank
@@ Property / cites work @@
+The precedence-constrained asymmetric traveling salesman polytope
+Normal rank
@@ Property / cites work @@
+Q4398361
@@ Property / cites work: Q4398361 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4532225
@@ Property / cites work: Q4532225 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3714900
@@ Property / cites work: Q3714900 / rank @@
+Normal rank
@@ Property / cites work @@
+A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
+Normal rank
@@ Property / DOI @@
+.1016/J.COR.2009.08.003
@@ Property / DOI: 10.1016/J.COR.2009.08.003 / rank @@
+Normal rank