AN IMPROVED CONDITIONAL MONTE-CARLO TECHNIQUE FOR THE STOCHASTIC SHORTEST-PATH PROBLEM

被引：11

|

作者：

ADLAKHA, VG

机构：

来源：

MANAGEMENT SCIENCE | 1986年 / 32卷 / 10期

关键词：

D O I：

10.1287/mnsc.32.10.1360

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

收藏

页码：1360 / 1367

页数：8

相关论文

共 50 条

[41] Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing
Briest, Patrick
Chalermsook, Parinya
Khanna, Sanjeev
Laekhanukit, Bundit
Nanongkai, Danupon
[J]. INTERNET AND NETWORK ECONOMICS, 2010, 6484 : 444 - +
[42] Dedicated Machine Constraint Scheduling as a Shortest-Path Problem
Pham, Huy Nguyen Anh
Shr, Arthur
Chen, Peter P.
[J]. ICTAI: 2009 21ST INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, 2009, : 559 - 566
[43] NETWORK REDUCTION FOR THE ACYCLIC CONSTRAINED SHORTEST-PATH PROBLEM
HASSAN, MMD
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1992, 63 (01) : 124 - 132
[44] IS SHORTEST-PATH PROBLEM NOT HARDER THAN MATRIX MULTIPLICATION
MORAN, S
[J]. INFORMATION PROCESSING LETTERS, 1981, 13 (02) : 85 - 86
[45] A PRIORITY QUEUE FOR THE ALL PAIRS SHORTEST-PATH PROBLEM
MOFFAT, A
TAKAOKA, T
[J]. INFORMATION PROCESSING LETTERS, 1984, 18 (04) : 189 - 193
[46] SHORTEST-PATH PROBLEM IS NOT HARDER THAN MATRIX MULTIPLICATION
ROMANI, F
[J]. INFORMATION PROCESSING LETTERS, 1980, 11 (03) : 134 - 136
[47] A REOPTIMIZATION ALGORITHM FOR THE SHORTEST-PATH PROBLEM WITH TIME WINDOWS
DESROCHERS, M
SOUMIS, F
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1988, 35 (02) : 242 - 254
[48] AN ORTHOGONAL SYSTOLIC ARRAY FOR THE ALGEBRAIC SHORTEST-PATH PROBLEM
ROBERT, Y
TRYSTRAM, D
[J]. COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE, 1986, 302 (06): : 241 - 244
[49] ADA MULTITASKING AND THE SINGLE SOURCE SHORTEST-PATH PROBLEM
CARLISLE, H
CRAWFORD, A
SHEPPARD, S
[J]. PARALLEL COMPUTING, 1987, 4 (01) : 75 - 91
[50] A SHORTEST-PATH ROUTING PROBLEM WITH RESOURCE-ALLOCATION
PEDERZOLI, G
SANCHO, NGF
[J]. JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1987, 124 (01) : 33 - 42

← 1 2 3 4 5 →