Home > Term: traveling salesman (TSP)
traveling salesman (TSP)
Find a path through a weighted graph which starts and ends at the same vertex, includes every other vertex exactly once, and minimizes the total cost of edges.
- ส่วนหนึ่งของคำพูด: noun
- อุตสาหกรรม/ขอบเขต: Computer science
- Category: Algorithms & data structures
- Government Agency: NIST
0
ผู้สร้าง
- GeorgeV
- 100% positive feedback