The following pages link to The orienteering problem: a survey (Q617509):
Displaying 50 items.
- The orienteering problem with time windows applied to robotic melon harvesting (Q255095) (← links)
- An iterated local search algorithm for the single-vehicle cyclic inventory routing problem (Q296579) (← links)
- The clustered orienteering problem (Q296772) (← links)
- A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem (Q296861) (← links)
- Optimal deterministic algorithms for some variants of online quota traveling salesman problem (Q296870) (← links)
- New results for the directed profitable rural postman problem (Q296876) (← links)
- A priori orienteering with time windows and stochastic wait times at customers (Q297061) (← links)
- An effective approach for scheduling coupled activities in development projects (Q319026) (← links)
- A matheuristic for the team orienteering arc routing problem (Q319589) (← links)
- A minimum cost network flow model for the maximum covering and patrol routing problem (Q319918) (← links)
- A branch-and-cut algorithm for the profitable windy rural postman problem (Q321108) (← links)
- The selective vehicle routing problem in a collaborative environment (Q322478) (← links)
- Integer programming formulations for the elementary shortest path problem (Q322844) (← links)
- Efficient meta-heuristics for the multi-objective time-dependent orienteering problem (Q323359) (← links)
- Orienteering problem: a survey of recent variants, solution approaches and applications (Q323527) (← links)
- Heuristics for the traveling repairman problem with profits (Q336352) (← links)
- Single string planning problem arising in liner shipping industries: a heuristic approach (Q336521) (← links)
- A two-stage approach to the orienteering problem with stochastic weights (Q336923) (← links)
- Scheduled penalty variable neighborhood search (Q337204) (← links)
- Solving the orienteering problem with time windows via the pulse framework (Q337360) (← links)
- An improved formulation for the maximum coverage patrol routing problem (Q337517) (← links)
- A tabu search algorithm for the multi-period inspector scheduling problem (Q337536) (← links)
- Heuristics for the time dependent team orienteering problem: application to tourist route planning (Q337623) (← links)
- Models and hybrid methods for the onshore wells maintenance problem (Q339625) (← links)
- A two-stage robust optimization approach for the mobile facility fleet sizing and routing problem under uncertainty (Q342259) (← links)
- Solving the team orienteering problem with cutting planes (Q342446) (← links)
- Time constrained maximal covering salesman problem with weighted demands and partial coverage (Q342578) (← links)
- Special issue on vehicle routing and scheduling: recent trends and advances (Q375973) (← links)
- The capacitated team orienteering problem with incomplete service (Q375974) (← links)
- An ILP-refined tabu search for the directed profitable rural postman problem (Q406489) (← links)
- Hybridized evolutionary local search algorithm for the team orienteering problem with time windows (Q415560) (← links)
- A simulated annealing heuristic for the team orienteering problem with time windows (Q439335) (← links)
- Approximation algorithms for the arc orienteering problem (Q477675) (← links)
- Modeling recreational systems using optimization techniques and information technologies (Q478052) (← links)
- Robust UAV mission planning (Q490224) (← links)
- The capacitated orienteering problem (Q496434) (← links)
- Addendum to ``Heuristics for the multi-period orienteering problem with multiple time windows'' (Q502476) (← links)
- Minisum and maximin aerial surveillance over disjoint rectangles (Q518456) (← links)
- The orienteering problem with stochastic travel and service times (Q646634) (← links)
- PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems (Q887207) (← links)
- On the adaptivity gap of stochastic orienteering (Q896283) (← links)
- The effective application of a new approach to the generalized orienteering problem (Q972648) (← links)
- A path relinking approach for the team orienteering problem (Q975993) (← links)
- Algorithms to solve the orienteering problem: A comparison (Q1119489) (← links)
- A fast and effective heuristic for the orienteering problem (Q1266618) (← links)
- Minimum directed 1-subtree relaxation for score orienteering problem (Q1291640) (← links)
- Strong linear programming relaxations for the orienteering problem (Q1328645) (← links)
- The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm (Q1590800) (← links)
- A matheuristic approach to the orienteering problem with service time dependent profits (Q1622800) (← links)
- The time constrained maximal covering salesman problem (Q1631991) (← links)
