Simone de Lima Martins

Efficient heuristics for the Steiner forest problem

Abstract Let be a connected undirected graph, a set of nodes, a set of edges, , and . Given a non‐negative weight function associated with its edges, a set of terminal sets , the Steiner forest problem (SFP) consists of finding a subset of edges with the minimal cost such that al...