2016-10-262016-10-262004978-3-540-20895-20302-9743http://hdl.handle.net/11441/48152Up 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.application/pdfengAttribution-NonCommercial-NoDerivatives 4.0 Internacionalhttp://creativecommons.org/licenses/by-nc-nd/4.0/info:eu-repo/semantics/bookPartinfo:eu-repo/semantics/openAccess10.1007/978-3-540-24619-0_19https://idus.us.es/xmlui/handle/11441/48152