A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs
From MaRDI portal
Publication:2884534
DOI10.1287/IJOC.14.3.228.116zbMath1238.90117OpenAlexW2109293843MaRDI QIDQ2884534
Eduardo Uchoa, Renato F. Werneck, Celso Carneiro Ribeiro
Publication date: 30 May 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/5cd31a764332d6dfc77ae6c331ab42c407a005a5
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (33)
A robust and scalable algorithm for the Steiner problem in graphs ⋮ 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 ⋮ Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints ⋮ GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem ⋮ A biased random-key genetic algorithm for the tree of hubs location problem ⋮ The rainbow Steiner tree problem ⋮ Tabu search and GRASP for the capacitated clustering problem ⋮ Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times ⋮ SCIP-Jack -- a solver for STP and variants with parallelization extensions ⋮ Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem ⋮ A benchmark library and a comparison of heuristic methods for the linear ordering problem ⋮ A biased random-key genetic algorithm for data clustering ⋮ Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs ⋮ Mixed integer programming formulations for Steiner tree and quality of service multicast tree problems ⋮ A GRASP algorithm for a capacitated, fixed charge, multicommodity network flow problem with uncertain demand and survivability constraints ⋮ A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure ⋮ Adaptive memory in multistart heuristics for multicommodity network design ⋮ Variable neighbourhood search: methods and applications ⋮ Worst-case performance of Wong's Steiner tree heuristic ⋮ Black box scatter search for general classes of binary optimization problems ⋮ Randomized heuristics for the Max-Cut problem ⋮ Mathematical methods for physical layout of printed circuit boards: an overview ⋮ NeuroPrim: an attention-based model for solving NP-hard spanning tree problems ⋮ GRASP with path-relinking for the generalized quadratic assignment problem ⋮ Variable neighbourhood search: Methods and applications ⋮ GRASP and path relinking for the max-min diversity problem ⋮ Scatter search --- wellsprings and challenges ⋮ A GRASP and path relinking heuristic for rural road network development ⋮ Non delayed relax-and-cut algorithms
Uses Software
This page was built for publication: A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs
