巡回セールスマン問題
1. Travelling salesman problemThe travelling salesman problem (TSP) is an NP-hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find the shortest possible route that visits each city exactly once and returns to the origin city. It is a special case of the travelling purchaser problem.
Read “Travelling salesman problem” on English Wikipedia
Read “巡回セールスマン問題” on Japanese Wikipedia
Read “Travelling salesman problem” on DBpedia
Read “Travelling salesman problem” on English Wikipedia
Read “巡回セールスマン問題” on Japanese Wikipedia
Read “Travelling salesman problem” on DBpedia
Discussions
Log in to talk about this word.