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

Journal of Parallel and Distributed Computing

Volumn 65, Issue 12, 2005, Pages 1578-1584

  Pan, Linqiang ^a,b,c   Martín Vide, Carlos ^c  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^b ANQING NORMAL UNIVERSITY   (China)

^c UNIVERSITAT ROVIRA I VIRGILI   (Spain)

Author keywords

0 1 Integer programming problem; Membrane computing; Multidimensional 0 1 knapsack problem; NP complete problem; P System

Indexed keywords

0-1 INTEGER PROGRAMMING PROBLEM; MEMBRANE COMPUTING; MULTIDIMENSIONAL 0-1 KNAPSACK PROBLEM; P SYSTEM;

ALGORITHMS; BIOLOGICAL MEMBRANES; COMPUTATIONAL COMPLEXITY; INTEGER PROGRAMMING; LINEAR SYSTEMS; MATHEMATICAL MODELS; PROBLEM SOLVING;

PARALLEL PROCESSING SYSTEMS;

EID: 27844440883     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2005.05.018     Document Type: Article

References (14)

1. A. Alhazov, C. Martín-Vide, and L. Pan Solving a PSPACE-complete problem by P systems with restricted active membranes Fund. Inform. 58 2 2003 66 77
2. M.R. Garey, D.J. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness, W.H. Freeman, San Francisco, 1979.
3. B. Gavish, and H. Pirkul Allocation of data bases and processors in a distributed computing system Manage. Distrib. Data Process. 31 1982 215 231
4. Gh. Pǎun, Computing with membranes, J. Comput. System Sci. 61(1) (2000) 108-143
5. and TUCS Research Report 208, 1998 (http://www.tucs.fi ).
6. Gh. Pǎun P systems with active membranes: attacking NP-complete problems J. Automata, Lang. Combin. 6 1 2001 75 90
7. G.h. Pǎun Membrane Computing: An Introduction 2002 Springer Heidelberg
8. M.J. Pérez-Jiménez, A. Riscos Núñez, A linear-time solution to the knapsack problem using active membranes, In: A. Alhazov, C. Martín-Vide, Gh. Pǎun (Eds.), Preproceedings of the Workshop on Membrane Computing. Tarragona, Spain, July 17-22, 2003.
9. M.J. Pérez-Jiménez, A. Romero-Jiménez, and F. Sancho-Caparrini Teoría de la Complejidad en Modelos de Computatión Celular con Membranas 2002 Editorial Kronos Sevilla
10. M.J. Pérez-Jiménez, A. Romero Jiménez, and F. Sancho-Caparrini Complexity classes in models of cellular computing with membranes Natural Comput. 2 3 2003 265 285
11. M.J. Pérez-Jiménez, A. Romero Jiménez, F. Sancho-Caparrini, A polynomial complexity class in P systems using membrane division, The Fifth Workshop on Descriptional Complexity of Formal Systems, Budapest, Hunagary, July 12-14, 2003.
12. M.J. Pérez-Jiménez, A. Romero Jiménez, F. Sancho Caparrini, Solving validity problem by active membranes with input, In: M. Cavaliere, C. Martín-Vide, Gh. Pǎun, (Eds.), Proceedings of the Brainstorming Week on Membrane Computing, Report GRLMC 26/03, 2003, 270-278.
13. W. Shih A branch & bound method for the multiconstraint zero-one knapsack problem J. Oper. Res. Soc. 30 1979 369 378
14. P. Sosík, Solving a PSPACE-complete problem by P systems with active membranes, In: M. Cavaliere, C. Martín-Vide, Gh. Pǎun (Eds.), Proceedings of the Brainstorming Week on Membrane Computing. Report GRLMC 26/03, 2003, pp. 305-312.