The capacitated orienteering problem (Q496434): Difference between revisions

@@ Property / cites work @@
+Complexity and approximation for traveling salesman problems with profits
+Normal rank
@@ Property / cites work @@
+The split delivery capacitated team orienteering problem
+Normal rank
@@ Property / cites work @@
+The capacitated team orienteering and profitable tour problems
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for deadline-TSP and vehicle routing with time-windows
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Orienteering and Discounted-Reward TSP
+Normal rank
@@ Property / cites work @@
+An exact algorithm for team orienteering problems
@@ Property / cites work: An exact algorithm for team orienteering problems / rank @@
+Normal rank
@@ Property / cites work @@
+A heuristic for the multiple tour maximum collection problem
+Normal rank
@@ Property / cites work @@
+The team orienteering problem
@@ Property / cites work: The team orienteering problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3579451
@@ Property / cites work: Q3579451 / rank @@
+Normal rank
@@ Property / cites work @@
+The Euclidean Orienteering Problem Revisited
@@ Property / cites work: The Euclidean Orienteering Problem Revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing
+Normal rank
@@ Property / cites work @@
+The orienteering problem
@@ Property / cites work: The orienteering problem / rank @@
+Normal rank
@@ Property / cites work @@
+New approaches to multi-objective optimization
@@ Property / cites work: New approaches to multi-objective optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Running Errands in Time: Approximation Algorithms for Stochastic Orienteering
+Normal rank
@@ Property / cites work @@
+Q4255028
@@ Property / cites work: Q4255028 / rank @@
+Normal rank
@@ Property / cites work @@
+Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, <i>k</i>-MST, and Related Problems
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for distance constrained vehicle routing problems
+Normal rank
@@ Property / cites work @@
+A TABU search heuristic for the team orienteering problem
+Normal rank
@@ Property / cites work @@
+The orienteering problem: a survey
@@ Property / cites work: The orienteering problem: a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for metric facility location and             <i>k</i>             -Median problems using the primal-dual schema and Lagrangian relaxation
+Normal rank