A surface-based DNA algorithm for solving the binary knapsack problem
DOI10.1016/J.AMC.2006.11.073zbMATH Open1113.92026OpenAlexW2057710279MaRDI QIDQ2372084FDOQ2372084
Authors: Majid Darehmiraki, Hasan Mishmast Nehi 
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
Recommendations
- Multi-constraint knapsack problem based on DNA computing
- Molecular solution to the 0-1 knapsack problem based on DNA computing
- A polynomial-time DNA computing solution for the bin-packing problem
- scientific article; zbMATH DE number 1342105
- A surface-based DNA algorithm for the minimal vertex cover problem
- Algorithm of DNA computing on optimal assignment problems
- DNA computing-based algorithm for assignment problems
- Knapsack problems based on three-stranded DNA structure model
Approximation methods and heuristics in mathematical programming (90C59) Biochemistry, molecular biology (92C40) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computational methods for problems pertaining to biology (92-08)
Cited In (13)
- Title not available (Why is that?)
- Title not available (Why is that?)
- DNA computing -- A functional model in the practical experiment in the laboratory
- A biological algorithm to solve the assignment problem based on DNA molecules computation
- A surface-based DNA algorithm for the minimal vertex cover problem
- Molecular solution to the 0-1 knapsack problem based on DNA computing
- A polynomial-time DNA computing solution for the bin-packing problem
- Knapsack problems based on three-stranded DNA structure model
- Biological computation of the solution to the quadratic assignment problem
- Solving 0-1 knapsack problems based on amoeboid organism algorithm
- Multi-constraint knapsack problem based on DNA computing
- Title not available (Why is that?)
- Solving two-dimensional cutting stock problem via a DNA computing algorithm
This page was built for publication: A surface-based DNA algorithm for solving the binary knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2372084)
