Dissertation > Excellent graduate degree dissertation topics show

0-1 Programming Problem Based on Sticker Model

Author: ZhiLingYing
Tutor: YinZhiXiang
School: Anhui University of Technology
Course: Applied Mathematics
Keywords: DNA Computing Sticker Model 0-1 programming problem
CLC: O221.4
Type: Master's thesis
Year: 2010
Downloads: 21
Quote: 0
Read: Download Dissertation

Abstract


Biomolecular computing is computation at the molecular scale, using biotechnology engineering techniques. Over the post few years, some insightful researchers have bridged the gap between the biological computing and actual DNA-based computation。Recently, Many scientists in different fields are interest in DNA computing model based on reaction of biochemistry Because DNA computing has been formed a new science field. Many results have been obtained domestically in the research area of DNA computing. DNA computing is a novel method of solving a class of intractable computational problems, in which the computing speeds up exponentially with the problem size. Up to now, many accomplishments have been made to improve its performance andincrease its reliability.Sticker model, whose features are that it does not require DNA strands’ extension, in the biological process, does not require biological enzyme action and is reusable of DNA strands, is one of the main models of DNA computing models, In this paper, utilizing these features of the model and its four basic operations (merger, separation, setting and clear), we try to solve the general 0-1 programming problem. The solution of DNA computing is put forward by YIN Zhi-xiang, thus we use the method learning from Professor Yin’s idea described in this article to go on solving.

Related Dissertations

  1. Coevolutionary Binary Ant Colony Algorithm,TP301.6
  2. Global Method for Stability Analysis of Slopes Based on Pan’s Maximum Principle,TU43
  3. Smoothing Newton Method for Nonlinear Programming Problem and SQP-Filter Method for Constrained Minimax Problem,O221.2
  4. A Nonmonotone Smoothing Newton Algorithm for Solving Zero-one Nonlinear Integer Programming Problems,O221.4
  5. Smoothing of Penalty Function,O221.2
  6. The Design and Implementation of DNA Computing Model Based on 0-1 Programming,TP3
  7. The Application of Molecular Beacons in DNA Computation,O221.4
  8. A Smoothing Method for an Inverse Linear Programming Problem,O221.1
  9. Optimality Conditions and Duality for Multiobjective Optimization,O174.13
  10. Newton Methods for Inverse Problems of Linear Programming and Quadratic Programming,O221.1
  11. Study of Aircraft Conflict Resolution Method,V355
  12. Optimality conditions and application of bilevel programming problem,O221
  13. Research on DNA Algorithm of 0-1 Programming Problem,TP301.6
  14. Optimal Technology and Application of reactive power compensation of the power supply system,TM761
  15. Research on Method of Physical Recombination Optimization of Manufacture Resource,TH16
  16. Methods for Unconstained Generalized Geometric Programming Problem,O221
  17. New Algorithm for Solving Bilevel Programming Problem,O221
  18. Constraint Qualification in a General Class of Nonconvex Nondifferentiable Mathematical Programming Problem and Its Corresponding Theorems,O221
  19. Research on Some Problems in Bilevel Programming,O221
  20. A Smoothing Newton Method for a Type of Inverse Quadratic Programming Problems with Second Order Cone Constraints,O224

CLC: > Mathematical sciences and chemical > Mathematics > Operations Research > Planning Theory ( mathematical programming) > Integer Programming
© 2012 www.DissertationTopic.Net  Mobile