SHORTEST PATHS IN PROBABILISTIC GRAPHS

被引：248

作者：

FRANK, H

机构：

来源：

OPERATIONS RESEARCH | 1969年 / 17卷 / 04期

关键词：

D O I：

10.1287/opre.17.4.583

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

Paper considers problem of finding shortest-path probability distributions in graphs whose branches are weighted with random lengths, examines consequences of various assumptions concerning nature of available statistical information, and gives exact method for computing probability distribution, as well as methods based on hypothesis testing and statistical estimation; Monte Carlo results are used to develop efficient method of hypothesis testing; pairwise comparison of paths is discussed.

引用

页码：583 / &

共 10 条

[1]

ABRAMOWITZ M, 1964, HANDB MATH, P949

[2]

Berge C., 1965, PROGRAMMING GAMES TR

[3]

Busacker R.G., 1965, FINITE GRAPHS NETWOR

[4]

Cramer H, 1946, METHODS MATH STAT

[5]

Fisz, 1963, PROBABILITY THEORY M

[6] ON OPTIMUM SYNTHESIS OF STATISTICAL COMMUNICATION NETS - PSEUDO PARAMETRIC TECHNIQUES [J].

FRANK, H ;

HAKIMI, SL .

JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 1967, 284 (06) :407-&

[7]

FRANK H, 1965, IEEE T CIRCUIT THEOR, VCT12, P413

[8]

JOHNSON NL, 1939, BIOMETRIKA, V40, P362

[9]

LEHMANN EL, 1959, TESTING STATISTICAL

[10] MONTE-CARLO METHODS AND THE PERT PROBLEM [J].

VANSLYKE, RM .

OPERATIONS RESEARCH, 1963, 11 (05) :839-860

← 1 →