A surface-based DNA algorithm for solving the binary knapsack problem

DOI10.1016/j.amc.2006.11.073zbMath1113.92026OpenAlexW2057710279MaRDI QIDQ2372084

Hassan Mishmast Nehi, Majid Darehmiraki

Publication date: 10 July 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.11.073

zbMATH Keywords

knapsack problemDNA computingDNA computing on surface

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Biochemistry, molecular biology (92C40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computational methods for problems pertaining to biology (92-08)

Related Items (2)

Solving 0-1 knapsack problems based on amoeboid organism algorithm ⋮ A polynomial-time DNA computing solution for the bin-packing problem

This page was built for publication: A surface-based DNA algorithm for solving the binary knapsack problem