NOTE ON THE STOCHASTIC SHORTEST-ROUTE PROBLEM

被引：25
|
作者：
CROUCHER, JS
机构：
来源：
NAVAL RESEARCH LOGISTICS | 1978年 / 25卷 / 04期
关键词：
D O I：
10.1002/nav.3800250415
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：729 / 732
页数：4
相关论文
共 50 条
  • [21] BOUNDING DISTRIBUTIONS FOR STOCHASTIC SHORTEST ROUTE AND STOCHASTIC PERT NETWORKS
    SHOGAN, AW
    OPERATIONS RESEARCH, 1975, 23 : B363 - B363
  • [22] Efficient shortest-route service on intelligent transportation system by using multi-dimensional index
    Liu, CM
    Wang, LC
    Chen, L
    Chang, CJ
    CCCT 2003 VOL, 2, PROCEEDINGS: COMMUNICATIONS SYSTEMS, TECHNOLOGIES AND APPLICATIONS, 2003, : 170 - 175
  • [23] SHORTEST-ROUTE METHODS .2. GROUP KNAPSACKS, EXPANDED NETWORKS, AND BRANCH-AND-BOUND
    DENARDO, EV
    FOX, BL
    OPERATIONS RESEARCH, 1979, 27 (03) : 548 - 566
  • [24] A note on the shortest lattice vector problem
    Kumar, R
    Sivakumar, D
    FOURTEENTH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 1999, : 200 - 204
  • [25] NOTE ON SHORTEST SPANNING TREE PROBLEM
    EVANS, JR
    GEOGRAPHICAL ANALYSIS, 1978, 10 (03) : 286 - 288
  • [26] Variations on the stochastic shortest path problem
    1600, Springer Verlag (8931):
  • [27] Variations on the Stochastic Shortest Path Problem
    Randour, Mickael
    Raskin, Jean-Francois
    Sankur, Ocan
    VERIFICATION, MODEL CHECKING, AND ABSTRACT INTERPRETATION (VMCAI 2015), 2015, 8931 : 1 - 18
  • [28] A NOTE ON THE PROBLEM OF UPDATING SHORTEST PATHS
    FUJISHIGE, S
    NETWORKS, 1981, 11 (03) : 317 - 319
  • [29] SOME COMPUTATIONAL NOTES ON SHORTEST ROUTE PROBLEM
    PAPE, U
    COMPUTER JOURNAL, 1968, 11 (02): : 240 - &
  • [30] SHORTEST ROUTE PROBLEM WITH SOFT TIME WINDOWS
    Braekers, Kris
    Janssens, Gerrit K.
    EUROPEAN SIMULATION AND MODELLING CONFERENCE 2013, 2013, : 279 - 283
12345