The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
From MaRDI portal
Publication:2766100
DOI<181::AID-NET2>3.0.CO;2-Y 10.1002/(SICI)1097-0037(199910)34:3<181::AID-NET2>3.0.CO;2-YzbMath0980.90094OpenAlexW2051892429MaRDI QIDQ2766100
Publication date: 27 January 2002
Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199910)34:3<181::aid-net2>3.0.co;2-y
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (29)
A robust and scalable algorithm for the Steiner problem in graphs ⋮ Carousel greedy: a generalized greedy algorithm with applications in optimization ⋮ A biased random-key genetic algorithm for the container pre-marshalling problem ⋮ Robust min-max regret covering problems ⋮ Enhanced second order algorithm applied to the capacitated minimum spanning tree problem ⋮ Initialization of metaheuristics: comprehensive review, critical analysis, and research directions ⋮ Rectangle packing with a recursive pilot method ⋮ A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem ⋮ A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs ⋮ Solving the continuous flow-shop scheduling problem by metaheuristics. ⋮ Solving group Steiner problems as Steiner problems. ⋮ Effective patient prioritization in mass casualty incidents using hyperheuristics and the pilot method ⋮ Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem ⋮ Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks ⋮ An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem ⋮ Search tree based approaches for parallel machine scheduling ⋮ Bringing order into the neighborhoods: Relaxation guided variable neighborhood search ⋮ The prize-collecting generalized minimum spanning tree problem ⋮ Geometric and LP-based heuristics for angular travelling salesman problems in the plane ⋮ Discrete particle swarm optimization for the minimum labelling Steiner tree problem ⋮ Probabilistic stopping rules for GRASP heuristics and extensions ⋮ Variable neighbourhood search for the minimum labelling Steiner tree problem ⋮ Mathematical methods for physical layout of printed circuit boards: an overview ⋮ Integrating the ambulance dispatching and relocation problems to maximize system's preparedness ⋮ VNS and second order heuristics for the min-degree constrained minimum spanning tree problem ⋮ Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem ⋮ Metaheuristics—the metaphor exposed ⋮ Solving container loading problems by block arrangement ⋮ Looking ahead with the pilot method
Cites Work
- Unnamed Item
- A note on two problems in connexion with graphs
- A fast algorithm for Steiner trees
- Path-distance heuristic for the Steiner problem in undirected networks
- On finding steiner vertices
- The Rectilinear Steiner Tree Problem is $NP$-Complete
- Efficient path and vertex exchange in steiner tree algorithms
- Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm
- Solving the Graphical Steiner Tree Problem Using Genetic Algorithms
- A faster approximation algorithm for the Steiner problem in graphs
This page was built for publication: The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
