{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T05:09:15Z","timestamp":1791263355058,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642125348","type":"print"},{"value":"9783642125355","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12535-5_41","type":"book-chapter","created":{"date-parts":[[2010,5,8]],"date-time":"2010-05-08T15:53:31Z","timestamp":1273334011000},"page":"352-360","source":"Crossref","is-referenced-by-count":7,"title":["High-Performance Heuristics for Optimization in Stochastic Traffic Engineering Problems"],"prefix":"10.1007","author":[{"given":"Evdokia","family":"Nikolova","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"3","key":"41_CR1","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/j.tcs.2007.02.034","volume":"378","author":"H. Ackermann","year":"2007","unstructured":"Ackermann, H., Newman, A., R\u00f6glin, H., V\u00f6cking, B.: Decision making based on approximate and smoothed pareto curves. Theor. Comput. Sci.\u00a0378(3), 253\u2013270 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"41_CR2","volume-title":"Convex Analysis and Optimization","author":"D. Bertsekas","year":"2003","unstructured":"Bertsekas, D., Nedi\u0107, A., Ozdaglar, A.: Convex Analysis and Optimization. Athena Scientific, Belmont (2003)"},{"key":"41_CR3","unstructured":"Carstensen, P.: The complexity of some problems in parametric linear and combinatorial programming. Ph.D. Dissertation, Mathematics Dept., Univ. of Michigan, Ann Arbor, Mich. (1983)"},{"key":"41_CR4","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press, Cambridge (2001)","edition":"2"},{"issue":"3","key":"41_CR5","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 II, J.E.: Arriving on time. Journal of Optimization Theory and Applications\u00a0127(3), 497\u2013513 (2005)","journal-title":"Journal of Optimization Theory and Applications"},{"key":"41_CR6","doi-asserted-by":"crossref","unstructured":"Lim, S., Balakrishnan, H., Gifford, D., Madden, S., Rus, D.: Stochastic motion planning and applications to traffic. In: Proceedings of the Eighth International Workshop on the Algorithmic Foundations of Robotics (WAFR), Guanajuato, Mexico (December 2008) (accepted)","DOI":"10.1007\/978-3-642-00312-7_30"},{"key":"41_CR7","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1145\/358172.358406","volume":"26","author":"R.P. Loui","year":"1983","unstructured":"Loui, R.P.: Optimal paths in graphs with stochastic or multidimentional weights. Communications of the ACM\u00a026, 670\u2013676 (1983)","journal-title":"Communications of the ACM"},{"key":"41_CR8","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1287\/trsc.34.2.198.12304","volume":"34","author":"E.D. Miller-Hooks","year":"2000","unstructured":"Miller-Hooks, 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":"41_CR9","first-page":"131","volume-title":"Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling","author":"E. Nikolova","year":"2006","unstructured":"Nikolova, E., Brand, M., Karger, D.R.: Optimal route planning under uncertainty. In: Long, D., et al. (eds.) Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, pp. 131\u2013141. AAAI, Menlo Park (2006)"},{"key":"41_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/11841036_50","volume-title":"Algorithms \u2013 ESA 2006","author":"E. Nikolova","year":"2006","unstructured":"Nikolova, E., Kelner, J.A., Brand, M., Mitzenmacher, M.: Stochastic shortest paths via quasi-convex maximization. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 552\u2013563. Springer, Heidelberg (2006)"},{"key":"41_CR11","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0304-3975(91)90263-2","volume":"84","author":"C. Papadimitriou","year":"1991","unstructured":"Papadimitriou, C., Yannakakis, M.: Shortest paths without a map. Theoretical Computer Science\u00a084, 127\u2013150 (1991)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"41_CR12","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1002\/(SICI)1097-0037(199603)27:2<133::AID-NET5>3.0.CO;2-L","volume":"27","author":"G. Polychronopoulos","year":"1996","unstructured":"Polychronopoulos, G., Tsitsiklis, J.: Stochastic shortest path problems with recourse. Networks\u00a027(2), 133\u2013143 (1996)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Large-Scale Scientific Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12535-5_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:54:49Z","timestamp":1606186489000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12535-5_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642125348","9783642125355"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12535-5_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}