Pages that link to "Item:Q1039671"
From MaRDI portal
The following pages link to A polynomial-time DNA computing solution for the bin-packing problem (Q1039671):
Displaying 6 items.
- A computational DNA solution approach for the quadratic Diophantine equation (Q275220) (← links)
- A biological algorithm to solve the assignment problem based on DNA molecules computation (Q278315) (← links)
- Spatial cluster analysis by the bin-packing problem and DNA computing technique (Q1956125) (← links)
- A multiobjective approach based on the behavior of fireflies to generate reliable DNA sequences for molecular computing (Q2396466) (← links)
- Solving two-dimensional cutting stock problem via a DNA computing algorithm (Q6095483) (← links)
- Minimal reversible circuit synthesis on a DNA computer (Q6191209) (← links)
