THE PERIOD ROUTING PROBLEM

被引：227

作者：

CHRISTOFIDES, N

BEASLEY, JE

机构：

来源：

NETWORKS | 1984年 / 14卷 / 02期

关键词：

D O I：

10.1002/net.3230140205

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：237 / 256

页数：20

共 9 条

[1]

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

[2] EXPECTED DISTANCES IN DISTRIBUTION PROBLEMS [J].

CHRISTOF.N ;

EILON, S .

OPERATIONAL RESEARCH QUARTERLY, 1969, 20 (04) :437-&

[3] SCHEDULING OF VEHICLES FROM CENTRAL DEPOT TO NUMBER OF DELIVERY POINTS [J].

CLARKE, G ;

WRIGHT, JW .

OPERATIONS RESEARCH, 1964, 12 (04) :568-&

[4] LOADING PROBLEM [J].

EILON, S ;

CHRISTOF.N .

MANAGEMENT SCIENCE SERIES A-THEORY, 1971, 17 (05) :259-268

[5]

Eilon S., 1971, DISTRIBUTION MANAGEM

[6] IMPLEMENTING VEHICLE ROUTING ALGORITHMS [J].

GOLDEN, BL ;

MAGNANTI, TL ;

NGUYEN, HQ .

NETWORKS, 1977, 7 (02) :113-148

[7] EFFECTIVE HEURISTIC ALGORITHM FOR TRAVELING-SALESMAN PROBLEM [J].

LIN, S ;

KERNIGHAN, BW .

OPERATIONS RESEARCH, 1973, 21 (02) :498-516

[8] ASSIGNMENT ROUTING PROBLEM [J].

RUSSELL, R ;

IGO, W .

NETWORKS, 1979, 9 (01) :1-17

[9] EFFECTIVE HEURISTIC FOR M-TOUR TRAVELING SALESMAN PROBLEM WITH SOME SIDE CONDITIONS [J].

RUSSELL, RA .

OPERATIONS RESEARCH, 1977, 25 (03) :517-524

← 1 →