GRASP Heuristics for the Steiner Forest Problem

In this work, a constructive heuristic was proposed to solve the Problem of
Steiner Forest (SFP). Computational experiments in well-known instances of literature in-
They pointed out that the results produced by our constructive heuristics exceeded 'those obtained
by the state-of-the-art primal-dual algorithm proposed by Agrawal et al. [1995] and implemented by
Ghalami and Grosu [2022]. Additionally, we proposed a new heuristic called GRASP-SFP,
that applies the GRASP metaheuristic to solve the SFP. Additional computational experiments
showed that GRASP-SFP, more specifically its local search phase, improved meaning
The results obtained by our proposed constructive algorithm.