2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. (Q1406038): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+A new approximation algorithm for the capacitated vehicle routing problem on a tree
+Normal rank
@@ Property / cites work @@
+Technical Note—Routing and Location-Routing p-Delivery Men Problems on a Path
+Normal rank
@@ Property / cites work @@
+Sales‐delivery man problems on treelike networks
+Normal rank
@@ Property / cites work @@
+A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
+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 @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+VEHICLE SCHEDULING ON A TREE TO MINIMIZE MAXIMUM LATENESS
+Normal rank
@@ Property / cites work @@
+Vehicle scheduling on a tree with release and handling times
+Normal rank
@@ Property / cites work @@
+Q4494938
@@ Property / cites work: Q4494938 / rank @@
+Normal rank
@@ Property / cites work @@
+Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks
+Normal rank
@@ Property / cites work @@
+Q5187226
@@ Property / cites work: Q5187226 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity Of The Single Vehicle Scheduling Problem On Graphs
+Normal rank
@@ Property / cites work @@
+Routing and Scheduling on a Shoreline with Release Times
+Normal rank
@@ Property / cites work @@
+Special cases of traveling salesman and repairman problems with time windows
+Normal rank
@@ Property / cites work @@
+Single-vehicle scheduling with time window constraints
+Normal rank