INSIGHTS INTO A MIXED CHINESE POSTMAN PROBLEM

被引:0
作者
WANG, HF
机构
关键词
MCPP; EXACT SOLUTION; ALGORITHM;
D O I
暂无
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In this study, we consider a Mixed Chinese Postman Problem in the form of an Integer Program and investigate its properties with both algebraic solutions and geometric configurations. The insights this study provides into their relationship have paved a way toward designing more efficient structural algorithm for finding an exact solution. Theoretical proofs are provided with numerical illustrations.
引用
收藏
页码:683 / 689
页数:7
相关论文
共 12 条
[1]  
[Anonymous], 1974, NETWORKS, DOI DOI 10.1002/NET.3230040106
[2]  
BAZARAA MOKHTAR S., 1990, LINEAR PROGRAMMING N
[3]  
Edmonds J., 1973, Mathematical Programming, V5, P88, DOI 10.1007/BF01580113
[4]  
EULAR L, 1736, COMENTARII ACADEMIAE, V8, P128
[5]   APPROXIMATION ALGORITHMS FOR SOME ROUTING PROBLEMS [J].
FREDERICKSON, GN ;
HECHT, MS ;
KIM, CE .
SIAM JOURNAL ON COMPUTING, 1978, 7 (02) :178-193
[6]   APPROXIMATION ALGORITHMS FOR SOME POSTMAN PROBLEMS [J].
FREDERICKSON, GN .
JOURNAL OF THE ACM, 1979, 26 (03) :538-554
[7]  
Kwan M., 1962, CHINESE MATH, V1
[8]   A NEW ALGORITHM FOR THE DIRECTED CHINESE POSTMAN PROBLEM [J].
LIN, YX ;
ZHAO, YC .
COMPUTERS & OPERATIONS RESEARCH, 1988, 15 (06) :577-584
[9]   CHINESE POSTMAN PROBLEM FOR MIXED NETWORKS [J].
MINIEKA, E .
MANAGEMENT SCIENCE, 1979, 25 (07) :643-648
[10]  
Minieka E., 1978, OPTIMIZATION ALGORIT