Pages that link to "Item:Q883915"
From MaRDI portal
The following pages link to Molecular solution to the 0-1 knapsack problem based on DNA computing (Q883915):
Displaying 10 items.
- A computational DNA solution approach for the quadratic Diophantine equation (Q275220) (← links)
- A DNA sticker algorithm for bit-substitution in a block cipher (Q436877) (← links)
- Molecular solution to the optimal linear arrangement problem based on DNA computation (Q937692) (← links)
- A polynomial-time DNA computing solution for the bin-packing problem (Q1039671) (← links)
- DNA computing -- A functional model in the practical experiment in the laboratory (Q1606612) (← links)
- Evolution of new algorithms for the binary knapsack problem (Q2003461) (← links)
- Networks of splicing processors with evaluation sets as optimization problems solvers (Q2282068) (← links)
- A surface-based DNA algorithm for solving the binary knapsack problem (Q2372084) (← links)
- (Q5456079) (← links)
- Solving two-dimensional cutting stock problem via a DNA computing algorithm (Q6095483) (← links)