%0 Journal Article
%T 对“货郎担问题”的深入解析
%A 汪林林 张林？
%J 计算机科学
%D 2002
%X thetravelingsalesmanproblem(tsp)isoneofthemostdifficultproblemsthatmanyscholarsallovertheworldarestudying.thispaperpointsoutthedisparitybetweenthedefinitionandtheclassicalsolutionoftspanditspracticalapplications,andth
%K 图论货郎担问题最优货郎担回路算法
%U http://www.jsjkx.com/jsjkx/ch/reader/view_abstract.aspx?file_no=7707051&flag=1