Two-dimensional cutting stock problem (TDCSP) is a well-known combinatorial optimization problem in which a given set of two-dimensional small pieces with different shapes should be cut from a given main board so that the demand of each small piece is satisfied and the total waste is minimized. Since TDCSP is an NP-complete problem, it is unsolvable in polynomial time on electronic computers. However, using the structure of DNA molecules, DNA computing algorithms are capable to solve NP-complete problems in polynomial time. In this paper, a DNA computing algorithm based on the sticker model is presented to find the optimal solution to TDCSP. It is proved that the time complexity of this algorithm on DNA computers is polynomial considering the number of small pieces and the length and width of the main board.

二维切割问题（TDCSP）是众所周知的组合优化问题，其中应从给定的主板上切割给定​​的一组形状不同的二维小块，从而满足每个小块的需求并总浪费最小化。由于TDCSP是一个NP完全问题，因此在多项式时间内无法在电子计算机上解决。但是，利用DNA分子的结构，DNA计算算法能够在多项式时间内解决NP完全问题。本文提出了一种基于标签模型的DNA计算算法，以寻求TDCSP的最优解。事实证明，该算法在DNA计算机上的时间复杂度是多项式，考虑了小块的数量以及主板的长度和宽度。