文件名称:abc
介绍说明－－下载内容均来自于网络，请自行研究使用
行商问题是一个经典的NP完全问题,多人旅行商问题的求解则更具挑战性。以往对求解多人旅行商问题的研究局限于以所有成员路径总和最小为优化标准-Salesmen problem is a classical NP complete problem, many people are solving the traveling salesman problem more challenging. Solving the traveling salesman problem of many previous studies limited to minimize the sum of all the members of the paths to optimize the standard
(系统自动生成,下载前可以参看下载内容)
下载文件列表
abc.docx