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 25 items.
- A matheuristic for the team orienteering arc routing problem (Q319589) (← links)
- 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)
- Strong linear programming relaxations for the orienteering problem (Q1328645) (← links)
- Solving the team orienteering arc routing problem with a column generation approach (Q1754007) (← links)
- Optimal solutions for routing problems with profits (Q1941380) (← 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)
- Proportion-based robust optimization and team orienteering problem with interval data (Q2253537) (← links)
- The multi-visit team orienteering problem with precedence constraints (Q2282540) (← links)
- An effective PSO-inspired algorithm for the team orienteering problem (Q2355862) (← links)
- An exact algorithm for team orienteering problems (Q2477614) (← links)
- A hybrid adaptive large neighborhood search heuristic for the team orienteering problem (Q2664363) (← links)
- Integer programming approaches to the multiple team formation problem (Q2668786) (← links)
- The capacitated team orienteering and profitable tour problems (Q3184456) (← links)
- Solving the Orienteering Problem through Branch-and-Cut (Q4427336) (← links)
- A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem (Q4922922) (← 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)