Pages that link to "Item:Q958452"

The following pages link to Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming (Q958452):

Displaying 19 items.

• The orienteering problem with time windows applied to robotic melon harvesting (Q255095) (← 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)
• Scheduled penalty variable neighborhood search (Q337204) (← links)
• Solving the orienteering problem with time windows via the pulse framework (Q337360) (← links)
• A branch-and-price approach for a multi-period vehicle routing problem (Q337422) (← links)
• A tabu search algorithm for the multi-period inspector scheduling problem (Q337536) (← links)
• A hybrid algorithm for the DNA sequencing problem (Q406500) (← links)
• Hybridized evolutionary local search algorithm for the team orienteering problem with time windows (Q415560) (← links)
• A simulated annealing heuristic for the team orienteering problem with time windows (Q439335) (← links)
• A column generation algorithm for the vehicle routing problem with soft time windows (Q538287) (← links)
• An efficient column-generation-based algorithm for solving a pickup-and-delivery problem (Q547107) (← links)
• The orienteering problem: a survey (Q617509) (← links)
• Heuristics for the multi-period orienteering problem with multiple time windows (Q732904) (← links)
• Iterated local search for the team orienteering problem with time windows (Q833556) (← links)
• A path relinking approach for the team orienteering problem (Q975993) (← links)
• Branch-and-Bound for Bi-objective Integer Programming (Q5139633) (← links)
• Exact and heuristic methods for a workload allocation problem with chain precedence constraints (Q6112777) (← links)
• The hazardous orienteering problem (Q6179713) (← links)