The following pages link to The team orienteering problem (Q1266617):
Displaying 50 items.
- Notes on the single route lateral transhipment problem (Q276506) (← links)
- A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem (Q296861) (← links)
- Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests (Q322826) (← links)
- Orienteering problem: a survey of recent variants, solution approaches and applications (Q323527) (← links)
- The multi-district team orienteering problem (Q336760) (← links)
- A math-heuristic for the warehouse location-routing problem in disaster relief (Q336848) (← 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 2-stage method for a field service routing problem with stochastic travel and service times (Q342116) (← links)
- Solving the team orienteering problem with cutting planes (Q342446) (← links)
- The capacitated team orienteering problem with incomplete service (Q375974) (← links)
- Hybridized evolutionary local search algorithm for the team orienteering problem with time windows (Q415560) (← links)
- The capacitated orienteering problem (Q496434) (← links)
- Local search for the undirected capacitated arc routing problem with profits (Q531469) (← links)
- The orienteering problem: a survey (Q617509) (← links)
- Heuristics for the multi-period orienteering problem with multiple time windows (Q732904) (← links)
- On the tour planning problem (Q763203) (← links)
- Heuristic algorithms for visiting the customers in a rolling schedule environment (Q850656) (← links)
- A memetic algorithm for the team orienteering problem (Q972625) (← links)
- A path relinking approach for the team orienteering problem (Q975993) (← links)
- The undirected capacitated arc routing problem with profits (Q975994) (← links)
- A fast and effective heuristic for the orienteering problem (Q1266618) (← links)
- A matheuristic approach to the orienteering problem with service time dependent profits (Q1622800) (← links)
- A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints (Q1652104) (← links)
- The bi-objective insular traveling salesman problem with maritime and ground transportation costs (Q1653384) (← links)
- Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems (Q1681305) (← links)
- Formulations for the orienteering problem with additional constraints (Q1686508) (← 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)
- Simultaneous sensor selection and routing of unmanned aerial vehicles for complex mission plans (Q1761229) (← links)
- A TABU search heuristic for the team orienteering problem (Q1764755) (← links)
- The team orienteering problem with time windows: an LP-based granular variable neighborhood search (Q1926697) (← links)
- Coupling ant colony systems with strong local searches (Q1926808) (← 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)
- Consistent vehicle routing with pickup decisions -- insights from sport academy training transfers (Q2076943) (← 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)
- Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem (Q2158007) (← links)
- Algorithm selection for the team orienteering problem (Q2163778) (← links)
- An effective hybrid search algorithm for the multiple traveling repairman problem with profits (Q2171586) (← links)
- A multi-cover routing problem for planning rapid needs assessment under different information-sharing settings (Q2178909) (← links)
- Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach (Q2184040) (← links)
- A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit (Q2196083) (← links)
- A generic exact solver for vehicle routing and related problems (Q2196312) (← 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)
