کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4636379 1340722 2007 5 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Molecular solution to the 0–1 knapsack problem based on DNA computing
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
Molecular solution to the 0–1 knapsack problem based on DNA computing
چکیده انگلیسی

Many combinatorial optimization problems are known to be NP-complete. A common point of view is that finding fast algorithms for such problems using a polynomial number of processors is unlikely. However, facts of this kind are usually established for “worst” case situations, and in practice many instances of NP-complete problems are successfully solved in polynomial time by such traditional combinatorial optimization techniques such as dynamic programming, branch-and-bound.New opportunities for an effective solution of combinatorial problems emerged with the advent of parallel machines. In this paper, we describe an algorithm which generates an optimal solution for the 0/1 integer knapsack problem on DNA computing.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 187, Issue 2, 15 April 2007, Pages 1033–1037
نویسندگان
, ,