A Quasi-polynomial Time Approximation Scheme for Euclidean CVRPTW (Q2942382): Difference between revisions

@@ Property / cites work @@
+The Truck Dispatching Problem
@@ Property / cites work: The Truck Dispatching Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle
+Normal rank
@@ Property / cites work @@
+Approximating a vehicle scheduling problem with time windows and handling times
+Normal rank
@@ Property / cites work @@
+An approximability result of the multi-vehicle scheduling problem on a path with release and handling times
+Normal rank
@@ Property / cites work @@
+Competitive memetic algorithms for arc routing problems
+Normal rank
@@ Property / cites work @@
+An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem
+Normal rank
@@ Property / cites work @@
+New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
+Normal rank
@@ Property / cites work @@
+Approximation schemes for NP-hard geometric optimization problems: a survey
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
+Normal rank
@@ Property / cites work @@
+Q5417633
@@ Property / cites work: Q5417633 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds and Heuristics for Capacitated Routing Problems
+Normal rank