Pages that link to "Item:Q4922922"

The following pages link to A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem (Q4922922):

Displaying 27 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)
• A branch-and-cut algorithm for the orienteering arc routing problem (Q342166) (← links)
• Solving the team orienteering problem with cutting planes (Q342446) (← links)
• The multi-vehicle probabilistic covering tour problem (Q724092) (← links)
• A memetic algorithm for the team orienteering problem (Q972625) (← links)
• The team orienteering problem (Q1266617) (← links)
• The snow team problem (clearing directed subgraphs by mobile agents) (Q1679971) (← links)
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search (Q1926697) (← 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)
• Consistent vehicle routing with pickup decisions -- insights from sport academy training transfers (Q2076943) (← links)
• Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem (Q2158007) (← links)
• Algorithm selection for the team orienteering problem (Q2163778) (← 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)
• The clustered team orienteering problem (Q2273693) (← 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)
• The team orienteering problem: formulations and branch-cut and price (Q2917295) (← links)
• Solving the Orienteering Problem through Branch-and-Cut (Q4427336) (← links)
• An iterated local search algorithm for the team orienteering problem with variable profits (Q5058860) (← links)
• Solving the team orienteering problem with nonidentical agents: A Lagrangian approach (Q6065837) (← links)
• Variable neighborhood search to solve the generalized orienteering problem (Q6070415) (← links)
• A revisited branch-and-cut algorithm for large-scale orienteering problems (Q6087525) (← links)