Last Updated
：2025/11/20
travelling salesman problem
Noun
Canada
UK
Japanese Meaning
巡回セールスマン問題：与えられた都市と各都市間を移動するコストをもとに、すべての都市を一度だけ訪問し、最後に出発点に戻る最も安いルートを求める、組合せ最適化問題。
Quizzes for review
(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
During the lecture, the professor used a graph to illustrate the travelling salesman problem and how heuristics can find near-optimal routes.
See correct answer
During the lecture, the professor used a graph to illustrate the travelling salesman problem and how heuristics can find near-optimal routes.
音声機能が動作しない場合はこちらをご確認ください
English - English
Word Edit Setting
- Users who have edit permission for words - All Users
- Screen new word creation
- Screen word edits
- Screen word deletion
- Screen the creation of new headword that may be duplicates
- Screen changing entry name
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Sentence Edit Setting
- Users who have edit permission for sentences - All Users
- Screen sentence deletion
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Quiz Edit Setting
- Users who have edit permission for quizzes - All Users
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
