A parallel grasp for the Steiner tree problem in graphs using a hybrid local search strategy
From MaRDI portal
Publication:5928213
DOI10.1023/A:1026546708757zbMath1044.90063OpenAlexW1582417773MaRDI QIDQ5928213
Celso Carneiro Ribeiro, Panos M. Pardalos, Simone L. Martins, Mauricio G. C. Resende
Publication date: 2000
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1026546708757
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
The rainbow Steiner tree problem, Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic, Metaheuristics: A Canadian Perspective, Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem, Mixed integer programming formulations for Steiner tree and quality of service multicast tree problems, A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure, Randomized heuristics for the Max-Cut problem, Metaheuristics in combinatorial optimization
Uses Software
