Competitive analysis of a dispatch policy for a dynamic multi-period routing problem (Q2467440): Difference between revisions

@@ Property / DOI @@
-.1016/j.orl.2007.02.006
@@ Property / DOI: 10.1016/j.orl.2007.02.006 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.orl.2007.02.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2058479983
@@ Property / OpenAlex ID: W2058479983 / rank @@
+Normal rank
@@ Property / cites work @@
+Competitive analysis for dynamic multiperiod uncapacitated routing problems
+Normal rank
@@ Property / cites work @@
+Q2728857
@@ Property / cites work: Q2728857 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for the on-line travelling salesman
@@ Property / cites work: Algorithms for the on-line travelling salesman / rank @@
+Normal rank
@@ Property / cites work @@
+The Online TSP Against Fair Adversaries
@@ Property / cites work: The Online TSP Against Fair Adversaries / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation and Online Algorithms
@@ Property / cites work: Approximation and Online Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+On-line algorithms for the dynamic traveling repair problem
+Normal rank
@@ Property / cites work @@
+News from the online traveling repairman.
@@ Property / cites work: News from the online traveling repairman. / rank @@
+Normal rank
@@ Property / cites work @@
+Q4039765
@@ Property / cites work: Q4039765 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.ORL.2007.02.006
@@ Property / DOI: 10.1016/J.ORL.2007.02.006 / rank @@
+Normal rank