Abstract
Recently, many researchers have demonstrated that computation by DNA tile self-assembly may be scalable and it is considered as a promising technique in nanotechnology. In this paper, we show how the tile self-assembly process can be used for solving the 0–1 multi-objective knapsack problem by mainly constructing four small systems which are nondeterministic guess system, multiplication system, addition system and comparing system, by which we can probabilistically get the feasible solution of the problem. Our model can successfully perform the 0–1 multi-objective knapsack problem in polynomial time with optimal Θ(1) distinct tile types, parallely and at very low cost.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
