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

This paper presents a particle swarm optimization for solving Steiner tree problem. In the
algorithm a tree structure representation is used to encode a particle. To realize the …

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

The Steiner tree problem seeks for the shortest tree connecting a given set of terminal
points. This paper discusses parallelization of algorithms for the Steiner tree problem. First, a …

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 …

This paper presents an artificial fish swarm algorithm for solving Steiner tree problem. A
novel encoding method of avoiding the loop generation for artificial fish representation of …

It is well known that the Steiner minimal tree problem is one of the classic nonlinear
combinatorial optimization problems. A visualization experiment approach succeeds in …

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 …

This paper presented a parallel local search algorithm for the Steiner tree problem. The
main contribution of this work is the o (n^ 2\log^ 2 n+\log n (n\log n)) parallel local search …

Dynamic Steiner tree problem (DST) is an important problem that has extensive applications
in many areas such as building multicast trees for mobile networks. DST problem is NP …