A hybrid GRASP with perturbations for the Steiner problem in graphs
From MaRDI portal
Publication:2884534
Recommendations
- scientific article; zbMATH DE number 1241389
- A parallel grasp for the Steiner tree problem in graphs using a hybrid local search strategy
- Local search with perturbations for the prize-collecting Steiner tree problem in graphs
- A GRASP heuristic using path-relinking and restarts for the Steiner traveling salesman problem
- A robust and scalable algorithm for the Steiner problem in graphs
Cited in
(34)- NeuroPrim: an attention-based model for solving NP-hard spanning tree problems
- A biased random-key genetic algorithm for data clustering
- Mixed integer programming formulations for Steiner tree and quality of service multicast tree problems
- Scatter search --- wellsprings and challenges
- A GRASP and path relinking heuristic for rural road network development
- Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints
- Variable neighbourhood search: Methods and applications
- Tabu search and GRASP for the capacitated clustering problem
- A benchmark library and a comparison of heuristic methods for the linear ordering problem
- Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic
- A biased random-key genetic algorithm for the tree of hubs location problem
- Mathematical methods for physical layout of printed circuit boards: an overview
- Variable neighbourhood search: methods and applications
- Randomized heuristics for the Max-Cut problem
- A robust and scalable algorithm for the Steiner problem in graphs
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
- Adaptive memory in multistart heuristics for multicommodity network design
- Worst-case performance of Wong's Steiner tree heuristic
- Black box scatter search for general classes of binary optimization problems
- A GRASP heuristic using path-relinking and restarts for the Steiner traveling salesman problem
- Solving two location models with few facilities by using a hybrid heuristic: a real health resources case
- A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem
- Power optimization in ad hoc wireless network topology control with biconnectivity requirements
- Solving Steiner trees: Recent advances, challenges, and perspectives
- The rainbow Steiner tree problem
- GRASP and path relinking for the max-min diversity problem
- GRASP with path-relinking for the generalized quadratic assignment problem
- A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure
- Non delayed relax-and-cut algorithms
- A GRASP algorithm for a capacitated, fixed charge, multicommodity network flow problem with uncertain demand and survivability constraints
- Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
- GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem
- SCIP-Jack -- a solver for STP and variants with parallelization extensions
- GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
This page was built for publication: A hybrid GRASP with perturbations for the Steiner problem in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2884534)
