非对称旅行商问题 at sp
对称旅行商问题
Symmetrical traveling salesman problem
以上为机器翻译结果，长、整句建议使用 人工翻译 。
黑白旅行商问题(BWTSP)是近年来出现的新NP -难解问题，根据图中边是否对称可以分为无向BWTSP和有向BWTSP两种。
The black and white salesman problem (BWTSP) is a new NP-hard problem, which can be divided into the undirected BWTSP and the directed BWTSP according to the symmetry of edges in graph.
youdao
应用推荐
模块上移
模块下移
不移动