A Family of P Systems for 0-1 Knapsack Problem

Ping Guo, Jian Zhu, Jing Chen


P system is a new kind of distributed parallel computing models, and its many variants are used to solve NP problems. In this paper, a family of cell-like P systems is proposed to solve knapsack problem and obtain an optimal solution in a linear time based on membrane division. And an instance is given to illustrate the feasibility and effectiveness of our designed P systems.

Full Text:



  • There are currently no refbacks.