Pages that link to "Item:Q4642121"

The following pages link to A branch‐and‐cut algorithm for the Team Orienteering Problem (Q4642121):

Displaying 23 items.

• A matheuristic for the team orienteering arc routing problem (Q319589) (← links)
• The team orienteering problem (Q1266617) (← links)
• The snow team problem (clearing directed subgraphs by mobile agents) (Q1679971) (← 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)
• Robust drone selective routing in humanitarian transportation network assessment (Q2083969) (← links)
• A biased-randomized discrete-event heuristic for coordinated multi-vehicle container transport across interconnected networks (Q2140358) (← 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 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)
• Crowdshipping by employees of distribution centers: optimization approaches for matching supply and demand (Q2242299) (← links)
• Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics (Q2273922) (← 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 exact method for the combinatorial bids generation problem with uncertainty on clearing prices, bids success, and contracts materialization (Q2676381) (← links)
• A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem (Q4922922) (← links)
• Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand (Q6056092) (← 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)
• A revisited branch-and-cut algorithm for large-scale orienteering problems (Q6087525) (← links)
• A flow-based model for the multivehicle covering tour problem with route balancing (Q6495377) (← links)