travelling salesman problem
1 article · search the full text for this term
-
Exhaustive Search Meets DNA Sequencing: A Comprehensive Review of TSP-Based Approaches
Abstract: Exhaustive search is a highly computational complex algorithm that checks every possibility to obtain the best solution. We illustrate an exhaustive search by applying it to three important problems: the traveling salesman problem, the knapsack problem, and the assignment problem. In this paper, we took a traveling salesman problem to explain DNA Sequencing. Since traveling salesman problem is an algorithmic problem that finds the shortest route between a set of …
Published in International Journal of Bioinformatics and Computational Biology · Vol. 2, Issue 2, 2024 · pp. 11–21 Read article