A polynomial-time DNA computing solution for the bin-packing problem
From MaRDI portal
Publication:1039671
DOI10.1016/j.amc.2009.07.051zbMath1191.68309OpenAlexW2083141139MaRDI QIDQ1039671
Carlos Alberto Alonso Sanches, Nei Yoshihiro Soma
Publication date: 23 November 2009
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2009.07.051
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
A computational DNA solution approach for the quadratic Diophantine equation ⋮ A biological algorithm to solve the assignment problem based on DNA molecules computation ⋮ A multiobjective approach based on the behavior of fireflies to generate reliable DNA sequences for molecular computing ⋮ Solving two-dimensional cutting stock problem via a DNA computing algorithm ⋮ Minimal reversible circuit synthesis on a DNA computer ⋮ Spatial cluster analysis by the bin-packing problem and DNA computing technique
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Molecular solution to the 0-1 knapsack problem based on DNA computing
- A surface-based DNA algorithm for solving the binary knapsack problem
- A DNA-based graph encoding scheme with its applications to graph isomorphism problems
- A DNA-based solution to the graph isomorphism problem using Adleman-Lipton model with stickers
This page was built for publication: A polynomial-time DNA computing solution for the bin-packing problem
