| 单词 | travelling salesman problem |
| 释义 | > as lemmastravelling salesman problem travelling salesman problem n. Mathematics (originally) the problem of determining the shortest route that passes through each of a set of points once and returns to the starting point; (in later use also) any problem which is solved by determining the optimal (according to certain criteria) path that passes through each of a set of points once and returns to the starting point. ΘΚΠ the world > relative properties > number > mathematics > [noun] > mathematical enquiry > proposition > problem > specific problem Deliac problem1636 word problem1903 travelling salesman problem1949 four-colour problem1962 1949 J. Robinson On Hamiltonian Game (U.S. Air Force: Project Rand RM-303) 1 The purpose of this note is to give a method for solving a problem related to the traveling salesman problem. 1982 Internat. Jrnl. Production Res. 20 758 There are a number of heuristic procedures whereby the matrix..may be solved as a travelling salesman problem. 2016 States News Service (Nexis) 1 Aug. A group of nine high school students..have tied eight world records for solving a version of the infamous Traveling Salesman Problem. < as lemmas |
| 随便看 |
英语词典包含1132095条英英释义在线翻译词条，基本涵盖了全部常用单词的英英翻译及用法，是英语学习的有利工具。