%0 Generic %D 2004 %T A linear-time solution for the knapsack problem with active membranes %A Mario J. Pérez-Jiménez %A Agustín Riscos-Núñez %C Amsterdam, The Netherlands %I Springer %P 250-268 %R 10.1007/b95207 %U http://www.springerlink.com/content/w9022lqp0llrp59r/?p=66cbdb919de942eaa08b51f476e22861&pi=18 %V 2933 %X Up to now, P systems dealing with numerical problems have been rarely considered in the literature. In this paper we present an effective solution to the Knapsack problem using a family of deterministic P systems with active membranes using 2-division. We show that the number of steps of any computation is of linear order, but polynomial time is required for pre-computing resources. %@ 978-3-540-20895-2