ON THE WINDY POSTMAN PROBLEM

被引:28
作者
GUAN, M
机构
[1] Univ of Waterloo, Dep of, Combinatorics and Optimization,, Waterloo, Ont, Can, Univ of Waterloo, Dep of Combinatorics and Optimization, Waterloo, Ont, Can
关键词
All Open Access; Bronze;
D O I
10.1016/0166-218X(84)90089-1
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
MATHEMATICAL TECHNIQUES
引用
收藏
页码:41 / 46
页数:6
相关论文
共 4 条
[1]  
EDMONDS J, 1965, OPER RES, VS 13, pB73
[2]  
Edmonds J., 1973, Mathematical Programming, V5, P88, DOI 10.1007/BF01580113
[3]   CHINESE POSTMAN PROBLEM FOR MIXED NETWORKS [J].
MINIEKA, E .
MANAGEMENT SCIENCE, 1979, 25 (07) :643-648
[4]   COMPLEXITY OF EDGE TRAVERSING [J].
PAPADIMITRIOU, CH .
JOURNAL OF THE ACM, 1976, 23 (03) :544-554