THE FLEET SIZE AND MIX PROBLEM FOR CAPACITATED ARC ROUTING

被引:131
作者
ULUSOY, G
机构
关键词
D O I
10.1016/0377-2217(85)90252-8
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:329 / 337
页数:9
相关论文
共 14 条
[1]   CLASSIFICATION IN VEHICLE-ROUTING AND SCHEDULING [J].
BODIN, L ;
GOLDEN, B .
NETWORKS, 1981, 11 (02) :97-108
[2]  
BURKARD RE, 1980, LECTURE NOTES EC MAT, V184
[3]  
CHAPLEAU L, 1982, PUBLICATION U MONTRE, V234
[4]  
Christofides N., 1973, Omega, V1, P719, DOI 10.1016/0305-0483(73)90089-3
[5]  
Dijkstra E.W., 1959, NUMER MATH, V1, P269, DOI DOI 10.1007/BF01386390
[6]  
Edmonds J., 1973, Mathematical Programming, V5, P88, DOI 10.1007/BF01580113
[7]   APPROXIMATION ALGORITHMS FOR SOME ROUTING PROBLEMS [J].
FREDERICKSON, GN ;
HECHT, MS ;
KIM, CE .
SIAM JOURNAL ON COMPUTING, 1978, 7 (02) :178-193
[8]   CAPACITATED ARC ROUTING-PROBLEMS [J].
GOLDEN, BL ;
WONG, RT .
NETWORKS, 1981, 11 (03) :305-315
[9]  
Kwan M., 1962, CHINESE MATH, V1
[10]   COMPLEXITY OF VEHICLE-ROUTING AND SCHEDULING PROBLEMS [J].
LENSTRA, JK ;
KAN, AHGR .
NETWORKS, 1981, 11 (02) :221-227