{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T00:32:14Z","timestamp":1712363534024},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,10,25]],"date-time":"2011-10-25T00:00:00Z","timestamp":1319500800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1007\/s10852-011-9165-1","type":"journal-article","created":{"date-parts":[[2011,10,24]],"date-time":"2011-10-24T13:06:26Z","timestamp":1319461586000},"page":"45-76","source":"Crossref","is-referenced-by-count":4,"title":["On the probabilistic min spanning tree Problem"],"prefix":"10.1007","volume":"11","author":[{"given":"Nicolas","family":"Boria","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C\u00e9cile","family":"Murat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vangelis","family":"Paschos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,10,25]]},"reference":[{"key":"9165_CR1","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1002\/1520-6750(199412)41:7<973::AID-NAV3220410709>3.0.CO;2-H","volume":"41","author":"I Averbakh","year":"1994","unstructured":"Averbakh, I., Berman, O., Simchi-Levi, D.: Probabilistic a priori routing-location problems. Naval Res. Logistics 41, 973\u2013989 (1994)","journal-title":"Naval Res. Logistics"},{"key":"9165_CR2","unstructured":"Bertsimas, D.J.: Probabilistic Combinatorial Optimization Problems. Phd thesis, Operations Research Center, MIT, Cambridge Mass., USA (1988)"},{"key":"9165_CR3","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1287\/trsc.23.3.184","volume":"3","author":"DJ Bertsimas","year":"1989","unstructured":"Bertsimas, D.J.: On probabilistic traveling salesman facility location problems. Transp. Sci. 3, 184\u2013191 (1989)","journal-title":"Transp. Sci."},{"key":"9165_CR4","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1002\/net.3230200302","volume":"20","author":"DJ Bertsimas","year":"1990","unstructured":"Bertsimas, D.J.: The probabilistic minimum spanning tree problem. Networks 20, 245\u2013275 (1990)","journal-title":"Networks"},{"issue":"6","key":"9165_CR5","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1287\/opre.38.6.1019","volume":"38","author":"DJ Bertsimas","year":"1990","unstructured":"Bertsimas, D.J., Jaillet, P., Odoni, A.: A priori optimization. Oper. Res. 38(6), 1019\u20131033 (1990)","journal-title":"Oper. Res."},{"issue":"1","key":"9165_CR6","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1016\/j.ejor.2003.10.016","volume":"161","author":"L Bianchi","year":"2005","unstructured":"Bianchi, L., Knowles, J., Bowler, N.: Local search for the probabilistic traveling salesman problem: correlation to the 2-p-opt and 1-shift algorithms. Eur. J. Oper. Res. 161(1), 206\u2013219 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"9165_CR7","volume-title":"Introduction to Stochastic Programming","author":"J Birge","year":"1997","unstructured":"Birge, J., Louveaux, F.: Introduction to Stochastic Programming. Springer, Berlin (1997)"},{"issue":"3","key":"9165_CR8","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/s10878-007-9112-2","volume":"17","author":"N Bourgeois","year":"2009","unstructured":"Bourgeois, N., Della Croce, F., Escoffier, B., Murat, C., Paschos, V.Th.: Probabilistic coloring of bipartite and split graphs. J. Comb. Optim. 17(3), 274\u2013311 (2009)","journal-title":"J. Comb. Optim."},{"key":"9165_CR9","unstructured":"Butelle, F.: Contribution \u00e0 l\u2019algorithmique distribu\u00e9e de contr\u00f4le: arbres couvrants avec et sans contraintes. PhD thesis, Universit\u00e9 Paris VIII (1994)"},{"issue":"6","key":"9165_CR10","doi-asserted-by":"crossref","first-page":"1028","DOI":"10.1145\/355541.355562","volume":"47","author":"B Chazelle","year":"2000","unstructured":"Chazelle, B.: A minimum spanning tree algorithm with inverse-ackerman type complexity. J. Assoc. Comput. Mach. 47(6), 1028\u20131047 (2000)","journal-title":"J. Assoc. Comput. Mach."},{"key":"9165_CR11","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1137\/0205051","volume":"5","author":"D Cheriton","year":"1976","unstructured":"Cheriton, D., Tarjan, R.E.: Finding minimum spanning trees. SIAM J. Comput. 5, 724\u2013742 (1976)","journal-title":"SIAM J. Comput."},{"key":"9165_CR12","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. McGraw-Hill (2001)"},{"key":"9165_CR13","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1287\/mnsc.1.3-4.197","volume":"1","author":"GW Dantzig","year":"1951","unstructured":"Dantzig, G.W.: Linear programming under uncertainty. Manage. Sci. 1, 197\u2013206 (1951)","journal-title":"Manage. Sci."},{"key":"9165_CR14","doi-asserted-by":"crossref","first-page":"233","DOI":"10.6028\/jres.071B.032","volume":"71B","author":"J Edmonds","year":"1967","unstructured":"Edmonds, J.: Optimum branchings. J. Res. Natl. Bur. Stand. 71B, 233\u2013240 (1967)","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"9165_CR15","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/S0304-3975(02)00888-5","volume":"301","author":"L Georgiadis","year":"2003","unstructured":"Georgiadis, L.: Arborescence optimization problems solvable by edmonds\u2019 algorithm. Theor. Comput. Sci. 301, 427\u2013437 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"9165_CR16","unstructured":"Jaillet, P.: Probabilistic Traveling Salesman Problem. Technical Report 185, Operations Research Center, MIT, Cambridge Mass., USA (1985)"},{"issue":"6","key":"9165_CR17","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1287\/opre.36.6.929","volume":"36","author":"P Jaillet","year":"1988","unstructured":"Jaillet, P.: A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Oper. Res. 36(6), 929\u2013936 (1988)","journal-title":"Oper. Res."},{"key":"9165_CR18","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1002\/net.3230220607","volume":"22","author":"P Jaillet","year":"1992","unstructured":"Jaillet, P.: Shortest path problems with node failures. Networks 22, 589\u2013605 (1992)","journal-title":"Networks"},{"key":"9165_CR19","volume-title":"Vehicle Routing: Methods and Studies","author":"P Jaillet","year":"1988","unstructured":"Jaillet, P., Odoni, A.: The probabilistic vehicle routing problem. In: Golden, B.L., Assad, A.A. (eds.) Vehicle Routing: Methods and Studies. North Holland, Amsterdam (1988)"},{"key":"9165_CR20","unstructured":"Korte, B.: Combinatorial Optimization: Theory and Algorithms, vol.\u00a021 of Algorithms and Combinatorics, 3rd edn. Springer (2006)"},{"key":"9165_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2620-6","volume-title":"Robust Discrete Optimization and its Applications","author":"P Kouvelis","year":"1997","unstructured":"Kouvelis, P., Yu, G.: Robust Discrete Optimization and its Applications. Kluwer Academic Publishers, Boston (1997)"},{"issue":"1","key":"9165_CR22","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Am. Math. Soc. 7(1), 48\u201350 (1956)","journal-title":"Proc. Am. Math. Soc."},{"key":"9165_CR23","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1002\/(SICI)1097-0037(199905)33:3<207::AID-NET7>3.0.CO;2-7","volume":"33","author":"C Murat","year":"1999","unstructured":"Murat, C., Paschos, V.Th.: The probabilistic longest path problem. Networks 33, 207\u2013219 (1999)","journal-title":"Networks"},{"key":"9165_CR24","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1016\/S0304-3975(01)00005-6","volume":"270","author":"C Murat","year":"2002","unstructured":"Murat, C., Paschos, V.Th.: A priori optimization for the probabilistic maximum independent set problem. Theor. Comput. Sci. 270, 561\u2013590 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9165_CR25","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1111\/1475-3995.00338","volume":"9","author":"C Murat","year":"2002","unstructured":"Murat, C., Paschos, V.Th.: The probabilistic minimum vertex-covering problem. Int. Trans. Opl. Res. 9(1):19\u201332 (2002)","journal-title":"Int. Trans. Opl. Res."},{"key":"9165_CR26","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1016\/j.dam.2005.06.007","volume":"154","author":"C Murat","year":"2006","unstructured":"Murat, C., Paschos, V.Th.: On the probabilistic minimum coloring and minimum k-coloring. Discrete Appl. Math. 154, 564\u2013586 (2006)","journal-title":"Discrete Appl. Math."},{"key":"9165_CR27","doi-asserted-by":"crossref","unstructured":"Paschos, V.Th., Telelis, O.A., Zissimopoulos, V.: Steiner forests on stochastic metric graphs. In: Dress, A., Xu, Y., Zhu, B. (eds.) Proc. Conference on Combinatorial Optimization and Applications, COCOA\u201907, vol.\u00a04616 of Lecture Notes in Computer Science, pp.\u00a0112\u2013123. Springer-Verlag (2007)","DOI":"10.1007\/978-3-540-73556-4_14"},{"issue":"1","key":"9165_CR28","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1002\/net.20346","volume":"56","author":"VTh Paschos","year":"2010","unstructured":"Paschos, V.Th., Telelis, O.A., Zissimopoulos, V.: Probabilistic models for the steiner tree problem. Networks 56(1), 39\u201349 (2010)","journal-title":"Networks"},{"key":"9165_CR29","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-017-3087-7","volume-title":"Stochastic Programming","author":"A Prekopa","year":"1995","unstructured":"Prekopa, A.: Stochastic Programming. Kluwer Academic Publishers, The Netherlands (1995)"},{"key":"9165_CR30","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"RE Tarjan","year":"1975","unstructured":"Tarjan, R.E.: Efficience of a good but not linear set-union algorithm. J. Assoc. Comput. Mach. 22, 215\u2013225 (1975)","journal-title":"J. Assoc. Comput. Mach."},{"key":"9165_CR31","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0020-0190(75)90056-3","volume":"4","author":"A Yao","year":"1975","unstructured":"Yao, A.: An\u00a0O(|E| log log |V|) algorithm for finding minimum spanning trees. Inf. Process. Lett. 4, 21\u201323 (1975)","journal-title":"Inf. Process. Lett."}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-011-9165-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-011-9165-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-011-9165-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,12]],"date-time":"2021-12-12T13:24:44Z","timestamp":1639315484000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-011-9165-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,25]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["9165"],"URL":"https:\/\/doi.org\/10.1007\/s10852-011-9165-1","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"value":"1570-1166","type":"print"},{"value":"1572-9214","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10,25]]}}}