The following pages link to The orienteering problem: a survey (Q617509):
Displaying 50 items.
- A robust optimization approach with probe-able uncertainty (Q2239954) (← links)
- Crowdshipping by employees of distribution centers: optimization approaches for matching supply and demand (Q2242299) (← links)
- An iterative three-component heuristic for the team orienteering problem with time windows (Q2255940) (← links)
- An adaptive large neighborhood search approach for multiple traveling repairman problem with profits (Q2273692) (← links)
- The clustered team orienteering problem (Q2273693) (← links)
- Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics (Q2273922) (← links)
- Multi-period orienteering with uncertain adoption likelihood and waiting at customers (Q2282513) (← links)
- The multi-visit team orienteering problem with precedence constraints (Q2282540) (← links)
- Capacitated ring arborescence problems with profits (Q2284638) (← links)
- Research on a novel minimum-risk model for uncertain orienteering problem based on uncertainty theory (Q2318262) (← links)
- Profitable mixed capacitated arc routing and related problems (Q2343077) (← links)
- An effective PSO-inspired algorithm for the team orienteering problem (Q2355862) (← links)
- A memetic algorithm for the multiperiod vehicle routing problem with profit (Q2355888) (← links)
- A note on the separation of subtour elimination constraints in elementary shortest path problems (Q2355890) (← links)
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
- A fast solution method for the time-dependent orienteering problem (Q2356249) (← links)
- Optimal duty rostering for toll enforcement inspectors (Q2398431) (← links)
- Evolution-inspired local improvement algorithm solving orienteering problem (Q2399337) (← links)
- The time-dependent orienteering problem with time windows: a fast ant colony system (Q2400030) (← links)
- Combined location and routing problems for drug distribution (Q2448896) (← links)
- A memetic algorithm for the orienteering problem with hotel selection (Q2514808) (← links)
- Orienteering problem with time-windows and updating delay (Q2658039) (← links)
- Ants can orienteer a thief in their robbery (Q2661549) (← links)
- A hybrid adaptive large neighborhood search heuristic for the team orienteering problem (Q2664363) (← links)
- Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows (Q2664372) (← links)
- A reinforcement learning approach to the orienteering problem with time windows (Q2668790) (← links)
- A swarm intelligence graph-based pathfinding algorithm (SIGPA) for multi-objective route planning (Q2668791) (← links)
- Selective routing problem with synchronization (Q2669549) (← links)
- Branch-and-check approaches for the tourist trip design problem with rich constraints (Q2669676) (← links)
- A Markov decision process model on dynamic routing for target surveillance (Q2669763) (← links)
- The profitable close-enough arc routing problem (Q2669779) (← links)
- Analysis of the selective traveling salesman problem with time-dependent profits (Q2701177) (← links)
- A two-time-level model for mission and flight planning of an inhomogeneous fleet of unmanned aerial vehicles (Q2701427) (← links)
- A survey of resource constrained shortest path problems: exact solution approaches (Q2811308) (← links)
- The split delivery capacitated team orienteering problem (Q2811321) (← links)
- The team orienteering pick-up and delivery problem with time windows and its applications in fleet sizing (Q2826662) (← links)
- The orienteering problem (Q3792511) (← links)
- A multifaceted heuristic for the orienteering problem (Q3795496) (← links)
- An Optimal Algorithm for the Orienteering Tour Problem (Q4030787) (← links)
- Solving the Orienteering Problem through Branch-and-Cut (Q4427336) (← links)
- Generalized orienteering problem with resource dependent rewards (Q4629173) (← links)
- An iterated local search algorithm for the team orienteering problem with variable profits (Q5058860) (← links)
- Selective generalized travelling salesman problem (Q5069320) (← links)
- Team Orienteering with Time-Varying Profit (Q5084650) (← links)
- The Robot Routing Problem for Collecting Aggregate Stochastic Rewards (Q5111626) (← links)
- Interdiction Games and Monotonicity, with Application to Knapsack Problems (Q5138270) (← links)
- On path-bridge inequalities for the orienteering arc routing problems (Q5151530) (← links)
- The orienteering problem with variable profits (Q5326782) (← links)
- Solving Relaxation Orienteering Problem Using DCA-CUT (Q5356984) (← links)
- A Memetic-GRASP Algorithm for the Solution of the Orienteering Problem (Q5357744) (← links)
