摘要
本文首次提出了赋权有向图上中国邮递员问题的一个推广-战争地区邮递员问题,并对解的存在性给出了若干充分条件和必要条件,得到了求解该问题的一个多项式算法.
The generalization of directed postman problem-postman problem in areas at war is proposed for the first time in the paper. Several sufficient and necessary conditions of the existence of solutions are suggested. Furthermore, a polynomial complexity algorithm is presented.
出处
《应用数学与计算数学学报》
2002年第1期85-89,共5页
Communication on Applied Mathematics and Computation