摘要
本文讨论网络图中部分结点环游的优化问题,怎样将该问题转化为完全图中的货郎担问题,并给出该问题的动态规划解法.
In this paper, the optimization of Part-Vertex Tours is studied, how is Part-Vertex Tours changed to traveling salesman problem(TSP), the method of dynamic programming is presented in the part-vertex tour.
出处
《运筹学学报》
CSCD
北大核心
2005年第2期93-96,共4页
Operations Research Transactions
