Zhishui Zhong

  • Citations Per Year
Learn More
Being a typical NP-complete problem, 0–1 knapsack problem is one of the classical combinatorial optimization problems, the traditional parallel processing techniques can not break through the limitations of the number of processors or the time's exponential increasing. But DNA computing is one of the potential strategies for solving these(More)
  • 1