A TISSUE P SYSTEM BASED SOLUTION TO QUADRATIC ASSIGNMENT PROBLEM
From MaRDI portal
Publication:4923294
DOI10.1142/S012905411240062XzbMath1264.68081MaRDI QIDQ4923294
Ibrahim Venkat, Rosni Abdullah, K. G. Subramanian, Yun-yun Niu
Publication date: 6 June 2013
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Combinatorial optimization (90C27)
Cites Work
- The power of communication: P systems with symport/antiport
- Solving multidimensional 0-1 knapsack problem by P systems with input and active membranes
- A survey for the quadratic assignment problem
- Computational complexity of tissue-like P systems
- Tissue P systems.
- Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices.
- Computing with membranes
- Solving large quadratic assignment problems on computational grids
- Further remark on P systems with active membranes and two polarizations
- Solving HPP and SAT by P systems with active membranes and separation rules
- Assignment Problems and the Location of Economic Activities
- P-Complete Approximation Problems
This page was built for publication: A TISSUE P SYSTEM BASED SOLUTION TO QUADRATIC ASSIGNMENT PROBLEM
