Approximation algorithms for time-dependent orienteering. (Q1853044): Difference between revisions

@@ Property / cites work @@
+Q4234074
@@ Property / cites work: Q4234074 / rank @@
+Normal rank
@@ Property / cites work @@
+The prize collecting traveling salesman problem
@@ Property / cites work: The prize collecting traveling salesman problem / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the TSP with sharpened triangle inequality
+Normal rank
@@ Property / cites work @@
+Efficient web searching using temporal factors
@@ Property / cites work: Efficient web searching using temporal factors / rank @@
+Normal rank
@@ Property / cites work @@
+The orienteering problem
@@ Property / cites work: The orienteering problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4952698
@@ Property / cites work: Q4952698 / rank @@
+Normal rank
@@ Property / cites work @@
+Bicriteria Network Design Problems
@@ Property / cites work: Bicriteria Network Design Problems / rank @@
+Normal rank
@@ Property / cites work @@
+On the approximability of the traveling salesman problem (extended abstract)
+Normal rank
@@ Property / cites work @@
+The Traveling Salesman Problem with Distances One and Two
+Normal rank
@@ Property / cites work @@
+On the approximability of an interval scheduling problem
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0020-0190(01)00313-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2039097929
@@ Property / OpenAlex ID: W2039097929 / rank @@
+Normal rank