单词 | traveling salesman problem |
释义 | traveling salesman problem [¦trav·ǝl·iŋ `sālz·mǝn ´präb·lǝm] MATHEMATICS The problem of performing successively a number of tasks, represented by vertices of a graph, with the least expenditure on transitions from one task to another, represented by edges of the graph with journey costs attached. |
随便看 |
|
科学参考收录了103327条科技类词条,基本涵盖了常见科技类参考文献及英语词汇的翻译,是科学学习和研究的有利工具。