LEE PATH CONNECTION ALGORITHM

被引：89

作者：

RUBIN, F ^{[1
]}

机构：

[1] IBM CORP, SYST DEV DIV, POUGHKEEPSIE, NY USA

来源：

IEEE TRANSACTIONS ON COMPUTERS | 1974年 / C 23卷 / 09期

关键词：

D O I：

10.1109/T-C.1974.224054

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：907 / 914

页数：8

共 13 条

[1] A MODIFICATION OF LEES PATH CONNECTION ALGORITHM [J].

AKERS, SB .

IEEE TRANSACTIONS ON ELECTRONIC COMPUTERS, 1967, EC16 (01) :97-+

[2] AUTOMATION OF ETCHING-PATTERN LAYOUT [J].

ARAMAKI, I ;

KAWABATA, T ;

ARIMOTO, K .

COMMUNICATIONS OF THE ACM, 1971, 14 (11) :720-+

[3] ON FINDING MINIMUM ROUTES IN A NETWORK WITH TURN PENALTIES [J].

CALDWELL, T .

COMMUNICATIONS OF THE ACM, 1961, 4 (02) :107-108

[4]

Dijkstra E. W., 1959, NUMERISCHE MATH, V1, P269, DOI DOI 10.1007/BF01386390

[5]

FISK CJ, 1967, P SHARE DESIGN AUTOM, V4

[6] A FORMAL BASIS FOR HEURISTIC DETERMINATION OF MINIMUM COST PATHS [J].

HART, PE ;

NILSSON, NJ ;

RAPHAEL, B .

IEEE TRANSACTIONS ON SYSTEMS SCIENCE AND CYBERNETICS, 1968, SSC4 (02) :100-+

[7]

HITCHNER LE, 1968, ORC6825 U CAL OP RES

[8] MINIMUM ROUTE PROBLEM FOR NETWORKS WITH TURN PENALTIES AND PROHIBITIONS [J].

KIRBY, RF ;

POTTS, RB .

TRANSPORTATION RESEARCH, 1969, 3 (03) :397-&

[9]

Lee CY, 1961, IRE T ELECTRON COMPU, VEC-10, P346, DOI DOI 10.1109/TEC.1961.5219222

[10]

MOORE EF, 1959, ANN COMPUTATION LABO, V30, P285

← 1 2 →