摘要
通过22种荧光标记DNA链的办法,在基于表面方式的实验环境中,将变量用变异的二进制变量组来表示,提出一种基于DNA计算的特殊整数规划问题的求解算法.算法通过将上述问题转化为特殊的-1-0-1规划问题,解决了运筹学中特殊的整数规划问题,并为最终解决一般的整数规划问题奠定了基础.
By using the method of 22 kinds of fluorescence labeling in experiment environment of the basedsurface approach, a DNA computation based algorithm for solving the problem of special integer planning was proposed. We have introduced a method, in which the above problem transforms into a special - 1, 0 and 1 integer planning problem. The solution of the special integer planning problem has paved the way for the complete solution of integer planning problems.
出处
《湖南大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2008年第1期80-83,共4页
Journal of Hunan University:Natural Sciences
基金
湖南省自然科学基金资助项目(06JJ20049)
湖南省教育厅优秀青年项目(06B047)
关键词
DNA计算
荧光标记
特殊的整数规划问题
DNA computing
fluorescence labeling
special integer planning problem
