A biological algorithm to solve the assignment problem based on DNA molecules computation

DOI10.1016/J.AMC.2014.06.098zbMath1335.90053OpenAlexW1987392002MaRDI QIDQ278315

F. Blanchet-Sadri, M. Dambrine

Publication date: 2 May 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2014.06.098

zbMATH Keywords

Adleman-Lipton modelDNA computationNP-complete problemthe assignment problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80) Computational methods for problems pertaining to biology (92-08)

Related Items (2)

Solving the maximum weighted clique problem based on parallel biological computing model ⋮ Solving the maximal matching problem with DNA molecules in Adleman–Lipton model

Cites Work

• Unnamed Item
• Solving the minimum bisection problem using a biologically inspired computational model
• DNA ternary addition
• A polynomial-time DNA computing solution for the bin-packing problem
• Solving traveling salesman problem in the Adleman-Lipton model

This page was built for publication: A biological algorithm to solve the assignment problem based on DNA molecules computation