Solving multidimensional 0-1 knapsack problem by P systems with input and active membranes

DOI10.1016/j.jpdc.2005.05.018zbMath1139.68341OpenAlexW2024750806MaRDI QIDQ852881

Carlos Martín-Vide, Lin-Qiang Pan

Publication date: 15 November 2006

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2005.05.018

zbMATH Keywords

knapsack problemmembrane computingP systemNP-complete problemmultidimensionalinteger programming problem

Mathematics Subject Classification ID

Related Items (11)

Computing with viruses ⋮ A bibliometric analysis of membrane computing (1998--2019) ⋮ Time-free solution to SAT problem using P systems with active membranes ⋮ A P-based hybrid evolutionary algorithm for vehicle routing problem with time windows ⋮ Computational efficiency and universality of timed P systems with active membranes ⋮ Time-free solution to SAT problem by P systems with active membranes and standard cell division rules ⋮ A uniform solution to the independent set problem through tissue P systems with cell separation ⋮ A TISSUE P SYSTEM BASED SOLUTION TO QUADRATIC ASSIGNMENT PROBLEM ⋮ Communication P systems on simplicial complexes with applications in cluster analysis ⋮ Solution to PSPACE-complete problem using P systems with active membranes with time-freeness ⋮ Time-free Solution to Independent Set Problem using P Systems with Active Membranes

This page was built for publication: Solving multidimensional 0-1 knapsack problem by P systems with input and active membranes