{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T17:38:57Z","timestamp":1758044337102,"version":"3.44.0"},"reference-count":29,"publisher":"Elsevier","isbn-type":[{"type":"print","value":"9780128172100"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1016\/b978-0-12-817210-0.00017-5","type":"book-chapter","created":{"date-parts":[[2020,8,14]],"date-time":"2020-08-14T09:56:55Z","timestamp":1597399015000},"page":"197-219","source":"Crossref","is-referenced-by-count":0,"title":["Random variables as arc parameters when solving shortest path problems"],"prefix":"10.1016","author":[{"given":"Deolinda M.L.","family":"Dias Rasteiro","sequence":"first","affiliation":[]},{"given":"Nelson","family":"Chibeles-Martins","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"10","key":"10.1016\/B978-0-12-817210-0.00017-5_br0005","doi-asserted-by":"crossref","first-page":"1360","DOI":"10.1287\/mnsc.32.10.1360","article-title":"An improved conditional Monte-Carlo technique for stochastic shortest route problem","volume":"32","author":"Adlakha","year":"1986","journal-title":"Management Science"},{"key":"10.1016\/B978-0-12-817210-0.00017-5_br0010","series-title":"Proceedings of the 32nd Annual ACM Symposium on Theory of Computing","article-title":"A random graph model for massive graphs","author":"Aiello","year":"2000"},{"author":"Amaral","key":"10.1016\/B978-0-12-817210-0.00017-5_br0015"},{"year":"1985","series-title":"Exploring stochastic shortest paths problems","author":"Andreatta","key":"10.1016\/B978-0-12-817210-0.00017-5_br0020"},{"issue":"7","key":"10.1016\/B978-0-12-817210-0.00017-5_br0025","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1287\/mnsc.37.2.198","article-title":"Arc reduction and path preference in stochastic acyclic networks","volume":"31","author":"Bard","year":"1991","journal-title":"Management Science"},{"year":"2001","series-title":"Random Graphs","author":"Bollob\u00e1s","key":"10.1016\/B978-0-12-817210-0.00017-5_br0030"},{"key":"10.1016\/B978-0-12-817210-0.00017-5_br0035","unstructured":"Chibeles-Martins N., Tavares, L.V., 1999. An\u00e1lise estat\u00edstica da criminalidade na cidade de Lisboa. 1995\u20131998, Reservado, Escola Superior de Pol\u00edcia."},{"key":"10.1016\/B978-0-12-817210-0.00017-5_br0040","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs","volume":"6","author":"Erd\u0151s","year":"1959","journal-title":"Publicationes Mathematicae"},{"key":"10.1016\/B978-0-12-817210-0.00017-5_br0045","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"Erd\u0151s","year":"1960","journal-title":"Publications of the Mathematical Institute of the Hungarian Academy of Sciences"},{"key":"10.1016\/B978-0-12-817210-0.00017-5_br0050","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02066689","article-title":"On the strength of connectedness of a random graph","volume":"12","author":"Erd\u0151s","year":"1961","journal-title":"Acta Mathematica Scientia Hungary"},{"year":"1970","series-title":"Utility Theory for Decision Making","author":"Fishburn","key":"10.1016\/B978-0-12-817210-0.00017-5_br0055"},{"key":"10.1016\/B978-0-12-817210-0.00017-5_br0060","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1287\/opre.17.4.583","article-title":"Shortest paths in probabilistic graphs","volume":"17","author":"Frank","year":"1969","journal-title":"Operations Research"},{"issue":"5","key":"10.1016\/B978-0-12-817210-0.00017-5_br0065","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1287\/opre.38.5.820","article-title":"Risk criteria in stochastic knapsack problem","volume":"38","author":"Henig","year":"1990","journal-title":"Operations Research"},{"key":"10.1016\/B978-0-12-817210-0.00017-5_br0070","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1002\/net.3230220607","article-title":"Shortest paths problems with node failures","volume":"22","author":"Jaillet","year":"1992","journal-title":"Networks"},{"issue":"6","key":"10.1016\/B978-0-12-817210-0.00017-5_br0075","doi-asserted-by":"crossref","first-page":"696","DOI":"10.1287\/opre.33.3.696","article-title":"A note on the stochastic shortest route problem","volume":"33","author":"Kamburowski","year":"1985","journal-title":"Operations Research"},{"key":"10.1016\/B978-0-12-817210-0.00017-5_br0080","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1145\/358172.358406","article-title":"Optimal paths in graphs with stochastic or multidimensional weights","volume":"26","author":"Loui","year":"1983","journal-title":"Communications of the ACM"},{"year":"1957","series-title":"Games and Decisions","author":"Luce","key":"10.1016\/B978-0-12-817210-0.00017-5_br0085"},{"issue":"1","key":"10.1016\/B978-0-12-817210-0.00017-5_br0090","first-page":"43","article-title":"The optimal path problem","volume":"19","author":"Martins","year":"1999","journal-title":"Investiga\u00e7\u00e3o Operacional"},{"key":"10.1016\/B978-0-12-817210-0.00017-5_br0095","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0305-0548(85)90034-6","article-title":"Optimal paths in probabilistic networks: a case with temporary preferences","volume":"12","author":"Mirchandini","year":"1985","journal-title":"Computers and Operations Research"},{"issue":"3","key":"10.1016\/B978-0-12-817210-0.00017-5_br0100","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1287\/trsc.30.3.220","article-title":"A relaxation-based pruning technique for a class of stochastic shortest path problems","volume":"30","author":"Murthy","year":"1996","journal-title":"Transportation Science"},{"key":"10.1016\/B978-0-12-817210-0.00017-5_br0105","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0377-2217(97)00264-6","article-title":"Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function","volume":"103","author":"Murthy","year":"1997","journal-title":"European Journal of Operational Research"},{"issue":"11","key":"10.1016\/B978-0-12-817210-0.00017-5_br0110","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1287\/mnsc.44.11.S125","article-title":"Stochastic shortest path problems with piecewise linear concave utility functions","volume":"44","author":"Murthy","year":"1998","journal-title":"Management Science"},{"year":"2001","series-title":"Random graphs with arbitrary degree distribution and their applications","author":"Newman","key":"10.1016\/B978-0-12-817210-0.00017-5_br0115"},{"year":"1965","series-title":"Introduction to Statistical Decision Theory","author":"Pratt","key":"10.1016\/B978-0-12-817210-0.00017-5_br0120"},{"issue":"1","key":"10.1016\/B978-0-12-817210-0.00017-5_br0125","doi-asserted-by":"crossref","first-page":"974","DOI":"10.1023\/B:JOTH.0000013560.69722.c1","article-title":"Optimal paths in probabilistic networks","volume":"120","author":"Rasteiro","year":"2004","journal-title":"Journal of Mathematical Sciences"},{"year":"1997","series-title":"O problema do trajecto \u00f3ptimo multiobjectivo","author":"Santos","key":"10.1016\/B978-0-12-817210-0.00017-5_br0130"},{"year":"1954","series-title":"The Foundations of Statistics","author":"Savage","key":"10.1016\/B978-0-12-817210-0.00017-5_br0135"},{"issue":"5","key":"10.1016\/B978-0-12-817210-0.00017-5_br0140","doi-asserted-by":"crossref","first-page":"1122","DOI":"10.1287\/opre.28.5.1122","article-title":"The stochastic shortest route problem","volume":"28","author":"Sigal","year":"1980","journal-title":"Operations Research"},{"year":"1947","series-title":"Theory of Games and Economic Behavior","author":"von Neumann","key":"10.1016\/B978-0-12-817210-0.00017-5_br0145"}],"container-title":["Calculus for Engineering Students"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780128172100000175?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780128172100000175?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,12]],"date-time":"2025-09-12T11:57:16Z","timestamp":1757678236000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9780128172100000175"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9780128172100"],"references-count":29,"URL":"https:\/\/doi.org\/10.1016\/b978-0-12-817210-0.00017-5","relation":{},"subject":[],"published":{"date-parts":[[2020]]}}}