A linear-time solution for the knapsack problem with active membranes

TitleA linear-time solution for the knapsack problem with active membranes
Publication TypeJournal Papers
Year of Publication2004
AuthorsPérez-Jiménez, M. J., & Riscos-Núñez A.
Journal TitleLecture Notes in Computer Science
ISBN Number978-3-540-20895-2
PublisherSpringer
Place PublishedAmsterdam, The Netherlands
Volume2933
Pages250-268
Abstract

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.

URLhttp://www.springerlink.com/content/w9022lqp0llrp59r/?p=66cbdb919de942eaa08b51f476e22861&pi=18
ISSN Number0302-9743
DOI10.1007/b95207