摘要
货郎担问题是组合优化中的著名问题 ,到目前为止它还没有一个有效算法。本文把它转化为增加限制条件的指派问题 ,对图邻接矩阵矩形对角进行分析 ,给出了这一问题的一个较好近似算法。
The solution on The Traveling Salesman Problem which is a famous problem in the combination optimal mathematics is very profound.After turning it into a Designate Problem and analyzing the opposite angles of a rectangle in the Adjacency Matrix about its figure,this paper gives an approximate algorithm about it.
出处
《常熟高专学报》
2001年第2期16-18,22,共4页
Journal of Changshu College
