Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem (Q3467845): Difference between revisions

@@ Property / author @@
-Mikhail Yu. Khachay
@@ Property / author: Mikhail Yu. Khachay / rank @@
-Normal rank
@@ Property / author @@
+Mikhail Yu. Khachay
@@ Property / author: Mikhail Yu. Khachay / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+VRP
@@ Property / describes a project that uses: VRP / 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.1007/978-3-319-26626-8_14
+Normal rank
@@ Property / OpenAlex ID @@
+W2295683163
@@ Property / OpenAlex ID: W2295683163 / rank @@
+Normal rank
@@ Property / cites work @@
+PTAS for k-Tour Cover Problem on the Plane for Moderately Large Values of k
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
+Normal rank
@@ Property / cites work @@
+Q4526992
@@ Property / cites work: Q4526992 / rank @@
+Normal rank
@@ Property / cites work @@
+The Truck Dispatching Problem
@@ Property / cites work: The Truck Dispatching Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q5417633
@@ Property / cites work: Q5417633 / rank @@
+Normal rank
@@ Property / cites work @@
+A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
+Normal rank
@@ Property / cites work @@
+Four-point conditions for the TSP: the complete complexity classification
+Normal rank
@@ Property / cites work @@
+The vehicle routing problem. Latest advances and new challenges.
+Normal rank
@@ Property / cites work @@
+Bounds and Heuristics for Capacitated Routing Problems
+Normal rank
@@ Property / cites work @@
+Approximability of the problem about a minimum-weight cycle cover of a graph
+Normal rank
@@ Property / cites work @@
+A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph
+Normal rank
@@ Property / cites work @@
+On Approximating Restricted Cycle Covers
@@ Property / cites work: On Approximating Restricted Cycle Covers / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum-weight cycle covers and their approximability
+Normal rank
@@ Property / cites work @@
+The Euclidean traveling salesman problem is NP-complete
+Normal rank
@@ Property / cites work @@
+P-Complete Approximation Problems
@@ Property / cites work: P-Complete Approximation Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4955264
@@ Property / cites work: Q4955264 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3467845