{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:51:06Z","timestamp":1725501066512},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744498"},{"type":"electronic","value":"9783540744504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74450-4_16","type":"book-chapter","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T05:49:24Z","timestamp":1189748964000},"page":"175-185","source":"Crossref","is-referenced-by-count":4,"title":["On the Minimum Risk-Sum Path Problem"],"prefix":"10.1007","author":[{"given":"Xujin","family":"Chen","sequence":"first","affiliation":[]},{"given":"Jie","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Xiaodong","family":"Hu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"16_CR1","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s10957-005-7498-5","volume":"127","author":"Y. Fan","year":"2005","unstructured":"Fan, Y., Kalaba, R., Moore, J.: Arriving on time. Journal of Optimization Theory and Applications\u00a0127(3), 497\u2013513 (2005)","journal-title":"Journal of Optimization Theory and Applications"},{"key":"16_CR2","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1287\/opre.17.4.583","volume":"17","author":"H. Frank","year":"1969","unstructured":"Frank, H.: Shortest paths in probabilistic graphs. Operations Research\u00a017, 583\u2013599 (1969)","journal-title":"Operations Research"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1016\/S0191-2615(98)00016-2","volume":"32","author":"L. Fu","year":"1998","unstructured":"Fu, L., Rilett, L.R.: Expected shortest paths in dynamic and stochastic traffic network. Transportation Research\u00a032, 499\u2013512 (1998)","journal-title":"Transportation Research"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.trb.2005.02.001","volume":"40","author":"S. Gao","year":"2006","unstructured":"Gao, S., Chabini, I.: Optimal routing policy problems in stochasic time-dependent networks. Transportation Research Part B: Methodological\u00a040, 93\u2013122 (2006)","journal-title":"Transportation Research Part B: Methodological"},{"key":"16_CR5","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1287\/trsc.20.3.182","volume":"20","author":"R.W. Hall","year":"1986","unstructured":"Hall, R.W.: The fastest path through a network with random time-dependent travel times. Transportation Science\u00a020, 182\u2013188 (1986)","journal-title":"Transportation Science"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1002\/net.3230100403","volume":"10","author":"G. Handler","year":"1980","unstructured":"Handler, G., Zang, I.: A dual algorithm for the constrained shortest path problem. Networks\u00a010, 293\u2013310 (1980)","journal-title":"Networks"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/moor.17.1.36","volume":"17","author":"R. Hassin","year":"1992","unstructured":"Hassin, R.: Approximation schemes for the restricted shortest path problem. Mathematics of Operations Research\u00a017, 36\u201342 (1992)","journal-title":"Mathematics of Operations Research"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0377-2217(86)90092-5","volume":"25","author":"M. Henig","year":"1985","unstructured":"Henig, M.: The shortest path problem with two objective functions. European Journal of Opertional Research\u00a025, 281\u2013291 (1985)","journal-title":"European Journal of Opertional Research"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0022-247X(66)90020-5","volume":"14","author":"H.K. Joksch","year":"1966","unstructured":"Joksch, H.K.: The shortest route problem with constraints. Journal of Mathematical Analysis and Applications\u00a014, 191\u2013197 (1966)","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"16_CR10","unstructured":"Kara\u015fan, O.E., Pinar, M.\u00c7., Yaman, H.: The robust shortest path problem with interval data. Computers & Operations Research (to appear)"},{"key":"16_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2620-6","volume-title":"Roubust Discrete Optimization and its Applications","author":"P. Kouvelis","year":"1997","unstructured":"Kouvelis, P., Yu, G.: Roubust Discrete Optimization and its Applications. Kluwer Academic Publishers, Boston (1997)"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1006\/jagm.1998.0930","volume":"28","author":"M.V. Marathe","year":"1998","unstructured":"Marathe, M.V., Ravi, R., Sundaram, R., Ravi, S.S., Rosenkrantz, D.J., Hunt III, H.B.: Bicriteria network design problems. Journal of Algorithms\u00a028, 142\u2013171 (1998)","journal-title":"Journal of Algorithms"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1287\/trsc.34.2.198.12304","volume":"34","author":"E.D. Miller-Hook","year":"2000","unstructured":"Miller-Hook, E.D., Mahmassani, H.S.: Least expected time paths in stochastic, time-varying transportation networks. Transportation Science\u00a034, 198\u2013215 (2000)","journal-title":"Transportation Science"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.orl.2003.08.002","volume":"32","author":"R. Montemanni","year":"2004","unstructured":"Montemanni, R., Gambardella, L.M., Donati, A.V.: A branch and bound algorithm for the robust shortest path problem with interval data. Operation Research Letters\u00a032, 225\u2013232 (2004)","journal-title":"Operation Research Letters"},{"issue":"4","key":"16_CR15","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1002\/net.10049","volume":"40","author":"S.T. Waller","year":"2002","unstructured":"Waller, S.T., Ziliaskopoulos, A.K.: On the online shortest path problem with limited arc cost dependencies. Networks\u00a040(4), 216\u2013227 (2002)","journal-title":"Networks"},{"key":"16_CR16","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/S0305-0548(97)00085-3","volume":"25","author":"G. Yu","year":"1998","unstructured":"Yu, G., Yang, J.: On the robust shortest path problem. Computers & Operations Research\u00a025, 457\u2013468 (1998)","journal-title":"Computers & Operations Research"},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1016\/S0377-2217(03)00373-4","volume":"158","author":"P. Zieli\u0144ski","year":"2004","unstructured":"Zieli\u0144ski, P.: The computational complexity of the relative robust shortest path problem with interval data. European Journal of Operational Research\u00a0158, 570\u2013576 (2004)","journal-title":"European Journal of Operational Research"}],"container-title":["Lecture Notes in Computer Science","Combinatorics, Algorithms, Probabilistic and Experimental Methodologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74450-4_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:28:01Z","timestamp":1619519281000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74450-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744498","9783540744504"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74450-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}