ARC ROUTING-PROBLEMS .1. THE CHINESE POSTMAN PROBLEM

被引：188

作者：

EISELT, HA ^{[1
]}

GENDREAU, M ^{[1
]}

LAPORTE, G ^{[1
]}

机构：

[1] UNIV MONTREAL, CTR RECH TRANSPORTS, MONTREAL, PQ, CANADA

来源：

OPERATIONS RESEARCH | 1995年 / 43卷 / 02期

关键词：

D O I：

10.1287/opre.43.2.231

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

Are routing problems arise in several areas of distribution management and have long been the object of study by mathematicians and operations researchers. In the first of a two-part survey, the Chinese postman problem (CPP) is considered. The main algorithmic results for the CPP are reviewed in five main sections: the undirected CPP, the directed CPP, the windy postman problem, the mixed CPP, and the hierarchical CPP.

引用

页码：231 / 242

页数：12

共 73 条

[51] Lenstra J. K., 1976, Networks, V6, P273, DOI 10.1002/net.3230060305
[52] LIEBLING TM, 1970, GRAPHENTHEORIE PLANU, V21
[53] A NEW ALGORITHM FOR THE DIRECTED CHINESE POSTMAN PROBLEM
LIN, YX
ZHAO, YC
[J]. COMPUTERS & OPERATIONS RESEARCH, 1988, 15 (06) : 577 - 584
[54] Liu DQ., 1988, ENG OPTIMIZ, V14, P127, DOI 10.1080/03052158808941206
[55] IMPROVEMENT OF ORLOFFS GENERAL ROUTING PROBLEM
MALE, JW
LIEBMAN, JC
ORLOFF, CS
[J]. NETWORKS, 1977, 7 (01) : 89 - 92
[56] Malek M., 1989, International Test Conference 1989. Proceedings. Meeting the Tests of Time (Cat. No.89CH2742-5), P103, DOI 10.1109/TEST.1989.82283
[57] PIERCE POINT MINIMIZATION AND OPTIMAL TORCH PATH DETERMINATION IN FLAME-CUTTING
MANBER, U
ISRANI, S
[J]. JOURNAL OF MANUFACTURING SYSTEMS, 1984, 3 (01) : 81 - 89
[58] MILIOTIS P, 1981, RAIRO-RECH OPER, V15, P233
[59] CHINESE POSTMAN PROBLEM FOR MIXED NETWORKS
MINIEKA, E
[J]. MANAGEMENT SCIENCE, 1979, 25 (07) : 643 - 648
[60] NOBERT Y, 1991, 799 CTR RECH TRANSP

← 1 2 3 4 5 6 7 8 →