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 40 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)
• A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints (Q1652104) (← links)
• A hybrid dynamic programming for solving fixed cost transportation with discounted mechanism (Q1659226) (← links)
• A unified matheuristic for solving multi-constrained traveling salesman problems with profits (Q1707083) (← links)
• Route relaxations on GPU for vehicle routing problems (Q1751660) (← 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)
• A computational study of solution approaches for the resource constrained elementary shortest path problem (Q1945074) (← links)
• Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem (Q2158007) (← links)
• Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach (Q2184040) (← links)
• An iterative three-component heuristic for the team orienteering problem with time windows (Q2255940) (← links)
• Multi-period orienteering with uncertain adoption likelihood and waiting at customers (Q2282513) (← links)
• Algorithms for non-linear and stochastic resource constrained shortest path (Q2417959) (← links)
• A column generation approach for a multi-attribute vehicle routing problem (Q2629734) (← links)
• An exact algorithm for Agile Earth Observation Satellite scheduling with time-dependent profits (Q2664286) (← links)
• Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows (Q2664372) (← links)
• An \(\varepsilon \)-constraint column generation-and-enumeration algorithm for bi-objective vehicle routing problems (Q2669681) (← links)
• A survey of resource constrained shortest path problems: Exact solution approaches (Q2811308) (← links)
• Branch-and-Bound for Bi-objective Integer Programming (Q5139633) (← links)
• A Memetic-GRASP Algorithm for the Solution of the Orienteering Problem (Q5357744) (← links)
• A Pricing Algorithm for the Vehicle Routing Problem with Soft Time Windows (Q5850940) (← links)
• Exact and heuristic methods for a workload allocation problem with chain precedence constraints (Q6112777) (← links)
• The hazardous orienteering problem (Q6179713) (← links)
• Centralized multi-visitor trip planning with activity reservations in crowded destinations (Q6568443) (← links)
• PathWyse: a flexible, open-source library for the resource constrained shortest path problem (Q6586912) (← links)