THE KAPPA MOST VITAL ARCS IN THE SHORTEST-PATH PROBLEM

被引：127

作者：

MALIK, K ^{[1
]}

MITTAL, AK ^{[1
]}

GUPTA, SK ^{[1
]}

机构：

[1] INDIAN INST TECHNOL,KANPUR 208016,UTTAR PRADESH,INDIA

来源：

OPERATIONS RESEARCH LETTERS | 1989年 / 8卷 / 04期

关键词：

D O I：

10.1016/0167-6377(89)90065-5

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：223 / 227

页数：5

共 10 条

[1]

AHUJA RK, 1987, MIT190587 WORK PAP S

[2] FINDING THE MOST VITAL ARCS IN A NETWORK [J].

BALL, MO ;

GOLDEN, BL ;

VOHRA, RV .

OPERATIONS RESEARCH LETTERS, 1989, 8 (02) :73-76

[3]

Corley H. W., 1982, Operations Research Letters, V1, P157, DOI 10.1016/0167-6377(82)90020-7

[4]

Even S., 1979, GRAPH ALGORITHMS

[5]

Ford L., 1962, FLOWS NETWORKS

[6] FIBONACCI HEAPS AND THEIR USES IN IMPROVED NETWORK OPTIMIZATION ALGORITHMS [J].

FREDMAN, ML ;

TARJAN, RE .

JOURNAL OF THE ACM, 1987, 34 (03) :596-615

[7]

JOHNSON DB, 1982, MATH SYST THEORY, V15, P295

[8] AN EFFICIENT ALGORITHM FOR K-SHORTEST SIMPLE PATHS [J].

KATOH, N ;

IBARAKI, T ;

MINE, H .

NETWORKS, 1982, 12 (04) :411-427

[9]

MALIK K, 1983, THESIS I TECHNOLOGY

[10]

MURTY K, 1976, LINEAR COMBINATORIAL

← 1 →