Solving multidimensional 0–1 knapsack problem by tissue P systems with cell division

Abstract

Tissue P systems with cell division are biologically inspired theoretical models of distributed and parallel computing, which provide the possibility to solve computationally hard problems in polynomial time. In this paper, we present a semi-uniform solution to the multidimensional 0–1 knapsack problem by such kind of devices, which is linear in terms of the number of variables, the number of constraint inequalities, and all coefficients related with variables.