Name
Abstract | ||
|---|---|---|
The quadratic assignment problem (QAP) is one of the fundamental combinatorial optimization problems, which models many real-life problems. However, it is considered as one of the most difficult NP-hard problems, which means that no polynomial-time algorithm is known to solve this intractable problem effectively. Even small instances of QAP may require vast computation time. In this work, a uniform cellular solution to QAP is proposed in the framework of membrane computing by using a family of recognizer tissue P systems with cell division. In the design of the solution, we encode the given instances in binary notations. The paper can be considered as a contribution to the study of considering a binary encoding of the information in P systems. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1142/S012905411240062X | INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE |
Keywords | Field | DocType |
Membrane computing, Tissue P system, cell division, quadratic assignment problem | ENCODE,Combinatorics,Mathematical optimization,Polynomial,Quadratic assignment problem,Generalized assignment problem,Algorithm,Membrane computing,Mathematics,Binary number,Computation,P system | Journal |
Volume | Issue | ISSN |
23 | 7 | 0129-0541 |
Citations | PageRank | References |
0 | 0.34 | 14 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yunyun Niu | 1 | 40 | 4.71 |
| K. G. Subramanian | 2 | 339 | 59.27 |
| Ibrahim Venkat | 3 | 70 | 14.37 |
| Rosni Abdullah | 4 | 156 | 24.82 |