Pages that link to "Item:Q2766100"
From MaRDI portal
The following pages link to The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs (Q2766100):
Displaying 29 items.
- A biased random-key genetic algorithm for the container pre-marshalling problem (Q342512) (← links)
- An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem (Q486397) (← links)
- Effective patient prioritization in mass casualty incidents using hyperheuristics and the pilot method (Q647505) (← links)
- Looking ahead with the pilot method (Q816423) (← links)
- Enhanced second order algorithm applied to the capacitated minimum spanning tree problem (Q869013) (← 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)
- Bringing order into the neighborhoods: Relaxation guided variable neighborhood search (Q953317) (← links)
- Discrete particle swarm optimization for the minimum labelling Steiner tree problem (Q968390) (← links)
- Mathematical methods for physical layout of printed circuit boards: an overview (Q991814) (← 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)
- Solving the continuous flow-shop scheduling problem by metaheuristics. (Q1410624) (← links)
- Solving group Steiner problems as Steiner problems. (Q1420439) (← links)
- A robust and scalable algorithm for the Steiner problem in graphs (Q1646683) (← links)
- Carousel greedy: a generalized greedy algorithm with applications in optimization (Q1652355) (← links)
- A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs (Q1698902) (← links)
- Solving container loading problems by block arrangement (Q1847191) (← links)
- Geometric and LP-based heuristics for angular travelling salesman problems in the plane (Q2003422) (← 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)
- The prize-collecting generalized minimum spanning tree problem (Q2476612) (← links)
- Probabilistic stopping rules for GRASP heuristics and extensions (Q4924054) (← links)
- Metaheuristics—the metaphor exposed (Q5246818) (← links)
- Initialization of metaheuristics: comprehensive review, critical analysis, and research directions (Q6056893) (← links)
- Rectangle packing with a recursive pilot method (Q6065652) (← links)
- A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem (Q6090469) (← links)
