rar

Traveling Salesman Problem

  • 2014-03-05
  • 1.17MB
  • Points it Requires : 2

The Traveling Salesman Problem (TSP) is one of the famous problems in mathematics. Suppose a traveling salesman wants to visit n cities. He must choose a path to take. The restriction of the path is that each city can only be visited once, and he must return to the original starting city in the end. The goal of path selection is to obtain a path with the minimum distance among all paths.

unfold

You Might Like

Uploader
jasionla
 

Recommended ContentMore

Popular Components

Just Take a LookMore

EEWorld
subscription
account

EEWorld
service
account

Automotive
development
circle

About Us Customer Service Contact Information Datasheet Sitemap LatestNews


Room 1530, 15th Floor, Building B, No.18 Zhongguancun Street, Haidian District, Beijing, Postal Code: 100190 China Telephone: 008610 8235 0740

Copyright © 2005-2024 EEWORLD.com.cn, Inc. All rights reserved 京ICP证060456号 京ICP备10001474号-1 电信业务审批[2006]字第258号函 京公网安备 11010802033920号
×