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):
Displaying 50 items.
- A matheuristic approach to the orienteering problem with service time dependent profits (Q1622800) (← links)
- A stochastic programming model for a tactical solid waste management problem (Q1622822) (← links)
- An efficient evolutionary algorithm for the orienteering problem (Q1652505) (← links)
- A profit-maximization location-routing-pricing problem: a branch-and-price algorithm (Q1653368) (← links)
- Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems (Q1681305) (← links)
- The time-dependent capacitated profitable tour problem with time windows and precedence constraints (Q1681438) (← links)
- Formulations for the orienteering problem with additional constraints (Q1686508) (← links)
- Variable neighborhood search for the set orienteering problem and its application to other orienteering problem variants (Q1734334) (← links)
- A general framework for assessing the value of social data for disaster response logistics planning (Q1750460) (← links)
- Solving the team orienteering arc routing problem with a column generation approach (Q1754007) (← links)
- Attractive orienteering problem with proximity and timing interactions (Q1754098) (← links)
- The set orienteering problem (Q1754239) (← links)
- The vehicle routing problem with profits and consistency constraints (Q1755266) (← links)
- \( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem (Q2026989) (← links)
- Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem (Q2027061) (← links)
- Prioritized single nurse routing and scheduling for home healthcare services (Q2029260) (← links)
- A biased random-key genetic algorithm for the set orienteering problem (Q2030452) (← links)
- Modeling and solving the multimodal car- and ride-sharing problem (Q2030528) (← links)
- A multi-period analysis of the integrated item-sharing and crowdshipping problem (Q2030599) (← links)
- Single-machine scheduling with release times, deadlines, setup times, and rejection (Q2030718) (← links)
- Consistent vehicle routing with pickup decisions -- insights from sport academy training transfers (Q2076943) (← links)
- Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach (Q2080825) (← links)
- Spatial coverage in routing and path planning problems (Q2083923) (← links)
- Robust drone selective routing in humanitarian transportation network assessment (Q2083969) (← links)
- Fairness in ambulance routing for post disaster management (Q2089315) (← links)
- The synchronized multi-assignment orienteering problem (Q2097466) (← links)
- Solving the traveling delivery person problem with limited computational time (Q2103948) (← links)
- New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources (Q2106718) (← links)
- Faster algorithms for orienteering and \(k\)-TSP (Q2124233) (← links)
- Boosting ant colony optimization via solution prediction and machine learning (Q2147035) (← links)
- Time dependent orienteering problem with time windows and service time dependent profits (Q2147060) (← links)
- UAV routing for reconnaissance mission: a multi-objective orienteering problem with time-dependent prizes and multiple connections (Q2147172) (← links)
- Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem (Q2158007) (← links)
- An integrated routing and scheduling problem for home healthcare delivery with limited person-to-person contact (Q2160498) (← links)
- Algorithm selection for the team orienteering problem (Q2163778) (← links)
- Carrier collaboration with the simultaneous presence of transferable and non-transferable utilities (Q2171605) (← links)
- Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach (Q2184040) (← links)
- A data-driven optimization framework for routing mobile medical facilities (Q2196113) (← links)
- Two-stage robust optimization for the orienteering problem with stochastic weights (Q2225187) (← links)
- An improvement heuristic based on variable neighborhood search for a dynamic orienteering problem (Q2233517) (← links)
- \(\mathrm{A}^\ast\) search for prize-collecting job sequencing with one common and multiple secondary resources (Q2241156) (← links)
- Tourist trip design with heterogeneous preferences, transport mode selection and environmental considerations (Q2241582) (← links)
- Mixed-integer programming approaches for the time-constrained maximal covering routing problem (Q2241905) (← links)
- Crowdshipping by employees of distribution centers: optimization approaches for matching supply and demand (Q2242299) (← links)
- The clustered team orienteering problem (Q2273693) (← 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)
- A greedy randomized adaptive search procedure for the orienteering problem with hotel selection (Q2286963) (← links)
- Research on a novel minimum-risk model for uncertain orienteering problem based on uncertainty theory (Q2318262) (← links)
- The time-dependent orienteering problem with time windows: a fast ant colony system (Q2400030) (← links)
