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

Authors:
Linqiang Pan;Carlos Martín-Vide
Affiliations:
Department of Control Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074, Hubei, PR China and Department of Mathematics, Anqing Teachers College, Anqing 246011, A ...;Research Group on Mathematical Linguistics, Rovira i Virgili University, Pl. Imperial Tárraco 1, 43005 Tarragona, Spain
Venue:
Journal of Parallel and Distributed Computing
Year:
2005

Citing 5
Cited 6

Computing with membranes

Journal of Computer and System Sciences
P systems with active membranes: attacking NP-complete problems

Journal of Automata, Languages and Combinatorics
Membrane Computing: An Introduction

Membrane Computing: An Introduction
Complexity classes in models of cellular computing with membranes

Natural Computing: an international journal
Solving a PSPACE-Complete Problem by Recognizing P Systems with Restricted Active Membranes

Fundamenta Informaticae

A Quantum-Inspired Evolutionary Algorithm Based on P systems for Knapsack Problem

Fundamenta Informaticae
Letters: A variant of P systems for optimization

Neurocomputing
A Tissue P Systems Based Uniform Solution to Tripartite Matching Problem

Fundamenta Informaticae
A Quantum-Inspired Evolutionary Algorithm Based on P systems for Knapsack Problem

Fundamenta Informaticae
Spiking neural P systems with anti-spikes and without annihilating priority working in a 'flip-flop' way

International Journal of Computing Science and Mathematics
Time-free solution to SAT problem using P systems with active membranes

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Membrane systems are biologically motivated theoretical models of distributed and parallel computing. In this paper, we present a membrane algorithm to solve multidimensional 0-1 knapsack problem in linear time by recognizer P systems with input and with active membranes using 2-division. This algorithm can also be modified to solve general 0-1 integer programming problem.