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

DOI10.1016/J.AMC.2006.09.020MaRDI QIDQ883915zbMATH OpenOpenAlexFDO

Authors Majid Darehmiraki, Hasan Mishmast Nehi

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

combinatorial optimizationdynamic programmingDNA computingbranch-and-boundfast algorithms0-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)

Recommendations

• Multi-constraint knapsack problem based on DNA computing
• A surface-based DNA algorithm for solving the binary knapsack problem
• A DNA computing model to solve 0-1 integer programming problem
• Molecular solution to the optimal linear arrangement problem based on DNA computation
• A polynomial-time DNA computing solution for the bin-packing problem
• DNA computation based on self-assembled nanoparticle probes for 0--1 integer programming problem
• A biological algorithm to solve the assignment problem based on DNA molecules computation
• DNA computing model of the 0-1 programming problem

Cites work

• Formal models of DNA computing: A survey

Cited in

(14)

• A DNA computing model to solve 0-1 integer programming problem
• A computational DNA solution approach for the quadratic Diophantine equation
• Networks of splicing processors with evaluation sets as optimization problems solvers
• Evolution of new algorithms for the binary knapsack problem
• A DNA sticker algorithm for bit-substitution in a block cipher
• Solving two-dimensional cutting stock problem via a DNA computing algorithm
• A polynomial-time DNA computing solution for the bin-packing problem
• Multi-constraint knapsack problem based on DNA computing
• Molecular solution to the optimal linear arrangement problem based on DNA computation
• scientific article; zbMATH DE number 2087016 (Why is no real title available?)
• A surface-based DNA algorithm for solving the binary knapsack problem
• scientific article; zbMATH DE number 5260685 (Why is no real title available?)
• Knapsack problems based on three-stranded DNA structure model
• DNA computing -- A functional model in the practical experiment in the laboratory

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q883915)