An asynchronous P system for the minimum Steiner tree with improved branch and bound

Abstract

In the membrane computing, most of the proposed algorithms for computationally hard problems use an exponential number of membranes, and reduction in the number of membranes must be considered in order to make the membrane computing a more realistic model.

In the present paper, we propose an asynchronous P system using improved branch and bound to solve the minimum Steiner tree. The experimental results show the validity and efficiency of the proposed P system.