The following pages link to The orienteering problem (Q3792511):
Displaying 50 items.
- Compact formulations of the Steiner traveling salesman problem and related problems (Q257227) (← 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)
- Network repair crew scheduling and routing for emergency relief distribution problem (Q320672) (← 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)
- The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach (Q336445) (← links)
- Single string planning problem arising in liner shipping industries: a heuristic approach (Q336521) (← links)
- The multi-district team orienteering problem (Q336760) (← links)
- A math-heuristic for the warehouse location-routing problem in disaster relief (Q336848) (← links)
- A two-stage approach to the orienteering problem with stochastic weights (Q336923) (← links)
- The dynamic multiperiod vehicle routing problem with probabilistic information (Q337038) (← links)
- Solving the orienteering problem with time windows via the pulse framework (Q337360) (← links)
- Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: an application to fish aggregating devices (Q337442) (← links)
- Heuristics for the time dependent team orienteering problem: application to tourist route planning (Q337623) (← links)
- Time constrained maximal covering salesman problem with weighted demands and partial coverage (Q342578) (← 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)
- The capacitated orienteering problem (Q496434) (← links)
- The directed orienteering problem (Q547309) (← links)
- The orienteering problem: a survey (Q617509) (← links)
- Iterated local search for the team orienteering problem with time windows (Q833556) (← links)
- Heuristic algorithms for visiting the customers in a rolling schedule environment (Q850656) (← links)
- On the adaptivity gap of stochastic orienteering (Q896283) (← links)
- The selective travelling salesman problem (Q910347) (← links)
- Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming (Q958452) (← 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)
- The attractive traveling salesman problem (Q1043335) (← links)
- On symmetric subtour problems (Q1202764) (← links)
- The team orienteering problem (Q1266617) (← links)
- A fast and effective heuristic for the orienteering problem (Q1266618) (← links)
- Minimum directed 1-subtree relaxation for score orienteering problem (Q1291640) (← links)
- An efficient composite heuristic for the symmetric generalized traveling salesman problem (Q1296792) (← links)
- A constant-factor approximation algorithm for the \(k\)-MST problem (Q1305925) (← links)
- A heuristic for the multiple tour maximum collection problem (Q1317095) (← links)
- The median tour and maximal covering tour problems: Formulations and heuristics (Q1328602) (← links)
- Strong linear programming relaxations for the orienteering problem (Q1328645) (← links)
- A TSSP+1 decomposition strategy for the vehicle routing problem (Q1342652) (← links)
- The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm (Q1590800) (← links)
- A tabu search heuristic for the undirected selective travelling salesman problem (Q1609914) (← links)
- A matheuristic approach to the orienteering problem with service time dependent profits (Q1622800) (← links)
- Shared capacity routing problem -- an omni-channel retail study (Q1622824) (← links)
- The time constrained maximal covering salesman problem (Q1631991) (← links)
- A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints (Q1652104) (← links)
- The probabilistic orienteering problem (Q1652250) (← links)
- An efficient evolutionary algorithm for the orienteering problem (Q1652505) (← links)
- The bi-objective insular traveling salesman problem with maritime and ground transportation costs (Q1653384) (← links)
