Approximation results for min-max path cover problems in vehicle routing (Q3065634): Difference between revisions

@@ Property / cites work @@
+Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
+Normal rank
@@ Property / cites work @@
+Approximations for minimum and min-max vehicle routing problems
+Normal rank
@@ Property / cites work @@
+\((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for some vehicle routing problems
+Normal rank
@@ Property / cites work @@
+Min-max tree covers of graphs.
@@ Property / cites work: Min-max tree covers of graphs. / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds and Heuristics for Capacitated Routing Problems
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Theory and algorithms.
+Normal rank
@@ Property / cites work @@
+A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree
+Normal rank
@@ Property / cites work @@
+Approximating the minmax rooted-tree cover in a tree
+Normal rank
@@ Property / cites work @@
+On the approximability of the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Approximation hardness of min-max tree covers
@@ Property / cites work: Approximation hardness of min-max tree covers / rank @@
+Normal rank