Simple methods for traveling salesman problems “2279

HIGHLIGHTS

  • who: Nodari Vakhania from the CentroUniversidad Autónoma del have published the Article: Simple Methods for Traveling Salesman Problems "2279, in the Journal: (JOURNAL) of 10/Oct/2021
  • how: The authors obtained preliminary experimental results for the 22 known benchmark instances.

SUMMARY

    Given n points and the distances between them, the aim is to construct a tour that visits each point exactly once and has the minimum total cost/distance (the total cost of a tour is the sum of the distances defined by each pair of points from that tour . . .

     

    Logo ScioWire Beta black

    If you want to have access to all the content you need to log in!

    Thanks :)

    If you don't have an account, you can create one here.

     

Scroll to Top

Add A Knowledge Base Question !

+ = Verify Human or Spambot ?