Pages that link to "Item:Q2514808"

The following pages link to A memetic algorithm for the orienteering problem with hotel selection (Q2514808):

Displaying 12 items.

• An effective approach for scheduling coupled activities in development projects (Q319026) (← links)
• A minimum cost network flow model for the maximum covering and patrol routing problem (Q319918) (← links)
• Orienteering problem: a survey of recent variants, solution approaches and applications (Q323527) (← links)
• A tabu search algorithm for the multi-period inspector scheduling problem (Q337536) (← links)
• A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection (Q1652522) (← links)
• Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities (Q1681274) (← links)
• The vacation planning problem: a multi-level clustering-based metaheuristic approach (Q2108189) (← links)
• Time dependent orienteering problem with time windows and service time dependent profits (Q2147060) (← links)
• Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach (Q2184040) (← links)
• A greedy randomized adaptive search procedure for the orienteering problem with hotel selection (Q2286963) (← links)
• A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection (Q2668646) (← links)
• A fast tri-individual memetic search approach for the distance-based critical node problem (Q6167524) (← links)