Grady Bullington

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-walks in graphs. We search for a shortest closed route visiting k cities in a non complete graph without weights. This motivates the following definition. Given a set of k distinct(More)
  • 1