Molecular solution to the 0-1 knapsack problem based on DNA computing

DOI10.1016/j.amc.2006.09.020zbMath1114.65328OpenAlexW1980525840MaRDI QIDQ883915

Hassan Mishmast Nehi, Majid Darehmiraki

Publication date: 12 June 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.09.020

zbMATH Keywords

dynamic programmingcombinatorial optimizationfast algorithmsbranch-and-boundDNA computing0-1 knapsack problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Cell biology (92C37)

Related Items (5)

A computational DNA solution approach for the quadratic Diophantine equation ⋮ Solving two-dimensional cutting stock problem via a DNA computing algorithm ⋮ A DNA sticker algorithm for bit-substitution in a block cipher ⋮ Evolution of new algorithms for the binary knapsack problem ⋮ A polynomial-time DNA computing solution for the bin-packing problem

Cites Work

• Unnamed Item

This page was built for publication: Molecular solution to the 0-1 knapsack problem based on DNA computing