Solving traveling salesman problem in the Adleman-Lipton model
From MaRDI portal
Publication:2250259
DOI10.1016/j.amc.2012.08.073zbMath1291.90211MaRDI QIDQ2250259
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
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
A biological algorithm to solve the assignment problem based on DNA molecules computation, 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, Solving the maximal matching problem with DNA molecules in Adleman–Lipton model
Cites Work