<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">386350302</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180307111827.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">161130e198907  xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1017/S0269964800001297</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">S0269964800001297</subfield>
   <subfield code="2">pii</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)cambridge-10.1017/S0269964800001297</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Dodin</subfield>
   <subfield code="D">Bajis</subfield>
   <subfield code="u">Graduate School of Management University of California Riverside, California 92521</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">Approximating the Stochastic Network by its M Shortest Paths</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Bajis Dodin]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">Given a stochastic activity network in which the length of some or all of the arcs are random variables with known probability distributions. This paper concentrates on identifying the shortest path and the M shortest paths in the network and on using the M paths to identify surrogate stochastic networks which are amenable for deriving analytical solutions. First, it identifies the M shortest paths using a certain form of stochastic dominance. Second, it identifies the M shortest paths by applying the deterministic methods to the network resulting from replacing the random length of every arc by its mean value. The two sets of the M paths are compared with those obtained by Monte Carlo sampling. Finally, the paper investigates how the distributional properties of the shortest path in the surrogate network compare with those of the shortest path in the original stochastic network.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Copyright © Cambridge University Press 1989</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Probability in the Engineering and Informational Sciences</subfield>
   <subfield code="d">Cambridge University Press</subfield>
   <subfield code="g">3/3(1989-07), 435-451</subfield>
   <subfield code="x">0269-9648</subfield>
   <subfield code="q">3:3&lt;435</subfield>
   <subfield code="1">1989</subfield>
   <subfield code="2">3</subfield>
   <subfield code="o">PES</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1017/S0269964800001297</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1017/S0269964800001297</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">100</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Dodin</subfield>
   <subfield code="D">Bajis</subfield>
   <subfield code="u">Graduate School of Management University of California Riverside, California 92521</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Probability in the Engineering and Informational Sciences</subfield>
   <subfield code="d">Cambridge University Press</subfield>
   <subfield code="g">3/3(1989-07), 435-451</subfield>
   <subfield code="x">0269-9648</subfield>
   <subfield code="q">3:3&lt;435</subfield>
   <subfield code="1">1989</subfield>
   <subfield code="2">3</subfield>
   <subfield code="o">PES</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="b">CC0</subfield>
   <subfield code="u">http://creativecommons.org/publicdomain/zero/1.0</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-cambridge</subfield>
  </datafield>
 </record>
</collection>
