Solving traveling salesman problem in the Adleman-Lipton model

DOI10.1016/J.AMC.2012.08.073MaRDI QIDQ2250259zbMATH OpenOpenAlexFDO

Authors Zhaocai Wang, Yiming Zhang, Weihua Zhou, Hai-Feng Liu

Publication date 4 July 2014

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

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

zbMATH Keywords

DNA computingAdleman-Lipton modelNP-complete problemthe traveling salesman problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• A DNA procedure for solving the shortest path problem
• Algorithm of DNA computing of TSP
• scientific article; zbMATH DE number 1342106
• On the power of DNA-computing
• Efficient DNA sticker algorithms for NP-complete graph problems

Cites work

• A DNA procedure for solving the shortest path problem
• DNA ternary addition
• PROCEDURES FOR COMPUTING THE MAXIMUM WITH DNA

Cited in

(7)

• Algorithm of DNA computing of TSP
• A biological algorithm to solve the assignment problem based on DNA molecules computation
• A DNA procedure for solving the shortest path problem
• Solving the maximal matching problem with DNA molecules in Adleman-Lipton model
• Exact models for the flying sidekick traveling salesman problem
• Solving the maximum weighted clique problem based on parallel biological computing model
• A multiobjective approach based on the behavior of fireflies to generate reliable DNA sequences for molecular computing

This page was built for publication: Solving traveling salesman problem in the Adleman-Lipton model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2250259)