The Traveling Salesman Problem (TSP) is a typical optimization problem, which belongs to a large family of problems classified as NP-complete. It has the important project background.
英
美
释义
旅行商问题(TSP)是一个有着重要工程背景、在图论中的典型组合优化问题,已被证实是一个NP完全问题。
把海词放在桌面上,查词最方便
触屏版
|
电脑版
©2003 - 2024 海词词典(Dict.cn)
立即下载