The following pages link to Looking ahead with the pilot method (Q816423):
Displaying 28 items.
- An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem (Q486397) (← links)
- An analysis of constructive algorithms for the airport baggage sorting station assignment problem (Q490384) (← links)
- Effective patient prioritization in mass casualty incidents using hyperheuristics and the pilot method (Q647505) (← links)
- Solving real-world vehicle routing problems in uncertain environments (Q657575) (← links)
- Enhanced second order algorithm applied to the capacitated minimum spanning tree problem (Q869013) (← links)
- PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems (Q887207) (← links)
- Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem (Q932185) (← links)
- Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks (Q932187) (← links)
- Search tree based approaches for parallel machine scheduling (Q941538) (← links)
- Single-pass and approximate dynamic-programming algorithms for order acceptance and capacity planning (Q964848) (← links)
- Scheduling trains as a blocking parallel-machine job shop scheduling problem (Q1017462) (← links)
- VNS and second order heuristics for the min-degree constrained minimum spanning tree problem (Q1025243) (← links)
- Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem (Q1027523) (← links)
- Total distance approximations for routing solutions (Q1628118) (← links)
- Managing platelet supply through improved routing of blood collection vehicles (Q1651648) (← links)
- Carousel greedy: a generalized greedy algorithm with applications in optimization (Q1652355) (← links)
- New insights on the block relocation problem (Q1652454) (← links)
- Partitioning of supply/demand graphs with capacity limitations: an ant colony approach (Q1698074) (← links)
- A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs (Q1698902) (← links)
- Robust min-max regret covering problems (Q2162527) (← links)
- Variable neighbourhood search for the minimum labelling Steiner tree problem (Q2267296) (← links)
- Integrating the ambulance dispatching and relocation problems to maximize system's preparedness (Q2294645) (← links)
- Solution techniques for the inter-modal pickup and delivery problem in two regions (Q2333155) (← links)
- Probabilistic stopping rules for GRASP heuristics and extensions (Q4924054) (← links)
- Comparison of metaheuristics for the <i>k</i>‐labeled spanning forest problem (Q5278227) (← links)
- Heuristic and metaheuristic methods for the multi‐skill project scheduling problem with partial preemption (Q6056166) (← links)
- Initialization of metaheuristics: comprehensive review, critical analysis, and research directions (Q6056893) (← links)
- A demand‐responsive feeder service with a maximum headway at mandatory stops (Q6180044) (← links)
