3) the Steiner Postman Problem
Steiner邮路问题
1.
Given graph G = (V, E),it E_0 is the set of required edges to be traversed, this paper considers a special case of the Steiner Postman Problem,in which the subgraph G[E0] has two connected branches.
给定图G=(V,E,w),E_0E是一个指定通过的边子集,本文讨论了关于E_0的Steiner邮路问题的特殊情况,即由E_0导出的子图仅有两个连通分支。
4) chinese postman problem
中国邮路问题
1.
Research on Chinese Postman Problem in Time-dependent Networks;
时间依赖网络中国邮路问题研究
2.
Research on Chinese Postman Problem in Stochastic Networks;
随机网络中国邮路问题算法研究
3.
In the paper,a solution method of the Chinese postman problem is given.
本文给出中国邮路问题的一个解法。
5) directed postmen problem
有向邮路问题
1.
This paper solves the directed postmen problem by genetic algorithms on the basis of transformation of graph.
在图形变换的基础上，用遗传算法实现了对有向邮路问题的求解本文所提方法较之传统方法更易于编程实现和求解大规模复杂网络问题实例表明，本方法能很好地收敛到有向邮路网络传统算法的结果
6) Chinese postman problem
中国邮递员问题
1.
A Thinking of Solving the Chinese Postman Problem;
求解中国邮递员问题的一种思路
2.
A new DNA encoding scheme to represent weights on a weighted graph is devised in this paper and a corresponding DNA algorithm for the Chinese postman problem is proposed using the encoding scheme.
设计了一种新的用于表示赋权图中边权的DNA编码方案,给出了用该方案求解中国邮递员问题的DNA算法,并利用Markov链分析了DNA算法中生成各种路径的随机过程。
3.
Based on the knowledge of the retail point could be taken as the route passing by the retail point in tobacco distribution network, the tobacco route optimization problem was transformed to Chinese Postman Problem in a network Map.
为解决烟草配送路线不合理的问题,根据烟草配送的特点建立烟草配送路径优化模型,基于配送所要到达的零售网点与配送必须经过其所在的道路等同的认识,把烟草配送路径优化问题转化为网络图中的中国邮递员问题,并利用Floyd算法求解烟草配送最短路径。
补充资料：通邮
1.国家﹑地区之间有邮件来往。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条