NP-complete problem

Solving the Family Traveling Salesperson Problem in the Adleman-Lipton model based on DNA computing

Author(s): Xian Wu, Zhao Cai Wang, Tun Hua Wu, Xiao Guang Bao
Solving the Family Traveling Salesperson Problem in the Adleman-Lipton model based on DNA computing 457 373 Transactions on NanoBioscience (TNB)

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