Steiner tree problem and its derivations are widely employed to optimize the design of
transportation, communication networks, biological engineering and the QoS multicast …

This paper deals with a new heuristic for the Steiner tree problem (STP) in graphs which
aims for the efficient construction of approximate solutions in very large graphs. The …

In\cite {siebert2019linear} the authors present a set of integer programs (IPs) for the Steiner
tree problem, which can be used for both, the directed and the undirected setting of the …

Given an undirected graph with weights associated with its edges, the Steiner tree problem
consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes of …

The underlying models of many practical problems in various engineering fields are
equivalent to the Steiner tree problem in graphs, which is a typical NP-hard combinatorial …

As one of the most well-known combinatorial optimization problems, Steiner tree problem is
widely applied to optimization in transportation design, biological engineering, and …

The minimum Steiner tree problem, a classical combinatorial optimization problem with a
long history, is a NP-complete problem. Due to its wide application, study of heuristic …

Given an undirected graph with weights associated with its nodes, the Steiner tree problem
consists in nding a minimum weight subgraph spanning a given subset of nodes (terminals) …

Steiner tree problem can be summarized as finding the minimum cost subtree or subnetwork
(minimum Steiner tree) spanning a subset of vertices identified as terminals in a network …

In this paper, a hybrid algorithm based on modified intelligent water drops algorithm and
learning automata for solving Steiner tree problem is proposed. Since the Steiner tree …