Pages that link to "Item:Q2917295"
From MaRDI portal
The following pages link to The Team Orienteering Problem: Formulations and Branch-Cut and Price (Q2917295):
Displaying 15 items.
- Orienteering problem: a survey of recent variants, solution approaches and applications (Q323527) (← links)
- Solving the team orienteering problem with cutting planes (Q342446) (← links)
- The capacitated team orienteering problem with incomplete service (Q375974) (← links)
- Robust UAV mission planning (Q490224) (← links)
- Solving the team orienteering arc routing problem with a column generation approach (Q1754007) (← links)
- Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem (Q2027061) (← 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)
- 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)
- Mixed-integer programming approaches for the time-constrained maximal covering routing problem (Q2241905) (← links)
- An effective PSO-inspired algorithm for the team orienteering problem (Q2355862) (← links)
- A hybrid adaptive large neighborhood search heuristic for the team orienteering problem (Q2664363) (← links)
- Solving the team orienteering problem with nonidentical agents: A Lagrangian approach (Q6065837) (← links)
- A revisited branch-and-cut algorithm for large-scale orienteering problems (Q6087525) (← links)