ARC ROUTING-PROBLEMS .1. THE CHINESE POSTMAN PROBLEM

被引：192

作者：

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 条

[1] MORPHOLOGY OF GROUND-STATES OF TWO-DIMENSIONAL FRUSTRATION MODEL [J].

BARAHONA, F ;

MAYNARD, R ;

RAMMAL, R ;

UHRY, JP .

JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 1982, 15 (02) :673-699

[2]

Barahona F, 1990, ALGORITHMS COMBINATO

[3]

Beltrami EJ, 1974, NETWORKS, V4, P65, DOI DOI 10.1002/NET.3230040106

[4]

BENAVENT E, 1983, QUADERNS ESTADISTICA, V7, P479

[5]

BODIN L, 1983, COMPUT OPER RES, V10, P63, DOI 10.1016/0305-0548(83)90030-8

[6] COMPUTER-ASSISTED SYSTEM FOR ROUTING AND SCHEDULING OF STREET SWEEPERS [J].

BODIN, LD ;

KURSH, SJ .

OPERATIONS RESEARCH, 1978, 26 (04) :525-537

[7]

BRUCKER P, 1981, GRAPH THEORETIC CONC, P354

[8]

Busacker R.G., 1965, FINITE GRAPHS NETWOR

[9]

Christofides N., 1973, Omega, V1, P719, DOI 10.1016/0305-0483(73)90089-3

[10]

Christofides N., 1975, GRAPH THEORY ALGORIT

← 1 2 3 4 5 6 7 8 →