Solving multidimensional 0-1 knapsack problem by P systems with input and active membranes
From MaRDI portal
Publication:852881
DOI10.1016/j.jpdc.2005.05.018zbMath1139.68341MaRDI 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
knapsack problem; membrane computing; P system; NP-complete problem; multidimensional; integer programming problem
Related Items
A TISSUE P SYSTEM BASED SOLUTION TO QUADRATIC ASSIGNMENT PROBLEM, Time-free Solution to Independent Set Problem using P Systems with Active Membranes, Computing with viruses, Computational efficiency and universality of timed P systems with active membranes, Communication P systems on simplicial complexes with applications in cluster analysis, A P-based hybrid evolutionary algorithm for vehicle routing problem with time windows, A uniform solution to the independent set problem through tissue P systems with cell separation, Time-free solution to SAT problem by P systems with active membranes and standard cell division rules, Solution to PSPACE-complete problem using P systems with active membranes with time-freeness, Time-free solution to SAT problem using P systems with active membranes
