“travelling salesman problem”的概念、定义、翻译、参考文献-科学参考

单词	travelling salesman problem
释义	travelling salesman problem Encyclopedia 理学旅行售货商问题释 travelling salesman problem；TSP旅行售货商问题一个组合优化问题。它在运筹学和理论计算机科学中被广泛研究，通常被描述为：给定一系列城市和每对城市之间的距离，求解访问每一座城市一次并回到起始城市的最短回路。 Mathematics travelling salesman problem流动推销员问题曾称“旅行商问题”^†，货郎担问题
随便看	totally disconnected totally disconnected compact group totally disconnected graph totally disconnected group totally disconnected set totally disconnected space totally disconnected topology totally enclosed fire resisting lifeboat totally finite measure totally flat module totally focal submanifold totally geodesic totally geodesic hypersurface totally geodesic manifold totally geodesic submanifold totally hyperbolic totally imaginary field totally imperfect set totally imperfect space totally inaccessible time totally integrable system totally invariant ideal totally irreducible totally irreducible set totally isolated ideal

科学参考收录了854744条科技类词条，基本涵盖了常见科技类参考文献及英语词汇的翻译，是科学学习和研究的有利工具。