Pages that link to "Item:Q342446"

The following pages link to Solving the team orienteering problem with cutting planes (Q342446):

Displaying 16 items.

• A profit-maximization location-routing-pricing problem: a branch-and-price algorithm (Q1653368) (← links)
• The vehicle routing problem with service level constraints (Q1681277) (← links)
• Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem (Q2027061) (← links)
• A biased-randomized discrete-event heuristic for coordinated multi-vehicle container transport across interconnected networks (Q2140358) (← links)
• Boosting ant colony optimization via solution prediction and machine learning (Q2147035) (← links)
• An effective hybrid search algorithm for the multiple traveling repairman problem with profits (Q2171586) (← 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)
• 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)
• A hybrid adaptive large neighborhood search heuristic for the team orienteering problem (Q2664363) (← links)
• Trip planning for visitors in a service system with capacity constraints (Q2676374) (← 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)
• GRASP‐ILS and set cover hybrid heuristic for the synchronized team orienteering problem with time windows (Q6079871) (← links)