Last Updated：2025/11/20
(mathematics, UK, Canada) The problem in combinatorial optimization in which, given a number of cities and the costs of travelling from one to the other, it is required to determine the cheapest route that visits each city once and then returns to the initial city.
音声機能が動作しない場合はこちらをご確認ください
See correct answer
travelling salesman problem
Edit Histories（0）
Source Word
travelling salesman problem
Noun
Canada
UK
Japanese Meaning
巡回セールスマン問題：与えられた都市と各都市間を移動するコストをもとに、すべての都市を一度だけ訪問し、最後に出発点に戻る最も安いルートを求める、組合せ最適化問題。
