Pages that link to "Item:Q2477614"

The following pages link to An exact algorithm for team orienteering problems (Q2477614):

Displaying 50 items.

• A matheuristic for the team orienteering arc routing problem (Q319589) (← links)
• Efficient meta-heuristics for the multi-objective time-dependent orienteering problem (Q323359) (← links)
• Orienteering problem: a survey of recent variants, solution approaches and applications (Q323527) (← links)
• The multi-district team orienteering problem (Q336760) (← links)
• Models and hybrid methods for the onshore wells maintenance problem (Q339625) (← links)
• A 2-stage method for a field service routing problem with stochastic travel and service times (Q342116) (← links)
• Solving the team orienteering problem with cutting planes (Q342446) (← links)
• The capacitated team orienteering problem with incomplete service (Q375974) (← links)
• Hybridized evolutionary local search algorithm for the team orienteering problem with time windows (Q415560) (← links)
• The capacitated orienteering problem (Q496434) (← links)
• The orienteering problem: a survey (Q617509) (← links)
• A tutorial on column generation and branch-and-price for vehicle routing problems (Q633483) (← links)
• Iterated local search for the team orienteering problem with time windows (Q833556) (← links)
• The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach (Q958447) (← links)
• Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming (Q958452) (← links)
• A memetic algorithm for the team orienteering problem (Q972625) (← links)
• A path relinking approach for the team orienteering problem (Q975993) (← links)
• The undirected capacitated arc routing problem with profits (Q975994) (← links)
• The team orienteering problem (Q1266617) (← links)
• A matheuristic approach to the orienteering problem with service time dependent profits (Q1622800) (← links)
• Managing platelet supply through improved routing of blood collection vehicles (Q1651648) (← links)
• Bi-objective orienteering for personal activity scheduling (Q1652268) (← links)
• The snow team problem (clearing directed subgraphs by mobile agents) (Q1679971) (← links)
• The vehicle routing problem with service level constraints (Q1681277) (← links)
• A branch-and-price approach to the feeder network design problem (Q1681514) (← links)
• Formulations for the orienteering problem with additional constraints (Q1686508) (← links)
• A general framework for assessing the value of social data for disaster response logistics planning (Q1750460) (← links)
• Branch-and-price approaches for the multiperiod technician routing and scheduling problem (Q1752769) (← links)
• Solving the team orienteering arc routing problem with a column generation approach (Q1754007) (← links)
• Simultaneous sensor selection and routing of unmanned aerial vehicles for complex mission plans (Q1761229) (← links)
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search (Q1926697) (← links)
• Coupling ant colony systems with strong local searches (Q1926808) (← 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)
• Robust drone selective routing in humanitarian transportation network assessment (Q2083969) (← links)
• The synchronized multi-assignment orienteering problem (Q2097466) (← links)
• Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem (Q2158007) (← 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)
• The capacitated team orienteering problem: a bi-level filter-and-fan method (Q2253406) (← links)
• The multi-visit team orienteering problem with precedence constraints (Q2282540) (← links)
• An effective PSO-inspired algorithm for the team orienteering problem (Q2355862) (← links)
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
• The multi-vehicle profitable pickup and delivery problem (Q2362250) (← 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)