Solving the Family Traveling Salesperson Problem in the Adleman-Lipton model based on DNA computing
https://www.embs.org/tnb/wp-content/uploads/sites/16/2021/09/Screen-Shot-2021-09-08-at-11.25.04-AM.png
457
373
Transactions on NanoBioscience (TNB)
//www.embs.org/tnb/wp-content/uploads/sites/16/2022/06/ieee-tnb-logo2x.png
The Family Traveling Salesperson Problem (FTSP) is a variant of the Traveling Salesperson Problem (TSP), in which all vertices are divided into several different families, and the goal of the…
read more