FINDING THE K-LEAST COST PATHS IN AN ACYCLIC ACTIVITY NETWORK

被引：7

作者：

HORNE, GJ

机构：

来源：

关键词：

D O I：

10.1057/jors.1980.79

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：443 / 448

页数：6

共 12 条

[1]

BATTERSBY A, 1963, NETWORK ANAL PLANNIN

[2] DUAL SHORTEST PATH ALGORITHM [J].

BAZARAA, MS ;

LANGLEY, RW .

[3]

Dijkstra E., 1959, NUMER MATH, V1, P269

[4] AN APPRAISAL OF SOME SHORTEST-PATH ALGORITHMS [J].

DREYFUS, SE .

[5]

Elmaghraby S. E., 1970, SOME NETWORK MODELS

MORRIS, WHM ;

NYGAARD, A .

JOURNAL OF FARM ECONOMICS, 1964, 46 (02) :410-417

NEMHAUSER, GL .

[8]

OGILVIE JR, 1975, P INT S LIVEST WAS D, V3, P446

[9]

Pierce A. R., 1975, Networks, V5, P129

[10]

PRESTON TA, 1967, CAN AGR ENG, V9, P109