Pages that link to "Item:Q323527"
From MaRDI portal
The following pages link to Orienteering problem: a survey of recent variants, solution approaches and applications (Q323527):
Displayed 34 items.
- 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)
- Selective routing problem with synchronization (Q2669549) (← links)
- A dynamic and probabilistic orienteering problem (Q2669558) (← links)
- Branch-and-check approaches for the tourist trip design problem with rich constraints (Q2669676) (← links)
- An \(\varepsilon \)-constraint column generation-and-enumeration algorithm for bi-objective vehicle routing problems (Q2669681) (← links)
- A decomposition approach for the stochastic asset protection problem (Q2669694) (← links)
- Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem (Q2676342) (← links)
- Multiperiod integrated spare parts and tour planning for on-site maintenance activities with stochastic repair requests (Q2676368) (← links)
- Analysis of the selective traveling salesman problem with time-dependent profits (Q2701177) (← 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)
- On path-bridge inequalities for the orienteering arc routing problems (Q5151530) (← links)
- Multi-period location routing: an application to the planning of mobile clinic operations in Iraq (Q6047833) (← links)
- Combining incomplete search and clause generation: an application to the orienteering problems with time windows (Q6057284) (← links)
- Solving the team orienteering problem with nonidentical agents: A Lagrangian approach (Q6065837) (← links)
- Rough approximation-based approach for designing a personalized tour route under a fuzzy environment (Q6065999) (← links)
- Large neighborhood search for the bike request scheduling problem (Q6069919) (← links)
- Variable neighborhood search to solve the generalized orienteering problem (Q6070415) (← links)
- Clustered coverage orienteering problem of unmanned surface vehicles for water sampling (Q6072147) (← links)
- GRASP‐ILS and set cover hybrid heuristic for the synchronized team orienteering problem with time windows (Q6079871) (← links)
- Solving the probabilistic profitable tour problem on a line (Q6081600) (← links)
- A revisited branch-and-cut algorithm for large-scale orienteering problems (Q6087525) (← links)
- A lexicographic maximin approach to the selective assessment routing problem (Q6103191) (← links)
- Planning robust drone-truck delivery routes under road traffic uncertainty (Q6112843) (← links)
- A new <i>MILP</i> formulation for the flying sidekick traveling salesman problem (Q6139381) (← links)
- An iterated local search for a multi‐period orienteering problem arising in a car patrolling application (Q6180047) (← links)
- Decision support for the technician routing and scheduling problem (Q6180048) (← links)
- A polynomial-time approximation scheme for thief orienteering on directed acyclic graphs (Q6182894) (← links)
- A new mathematical model and a heuristic algorithm for the tourist trip design problem under new constraints: a real-world application (Q6191670) (← links)
- Flexible vehicle scheduling with precedence constraints for tourists (Q6195032) (← links)