{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:10:25Z","timestamp":1725516625968},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540850960"},{"type":"electronic","value":"9783540850977"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85097-7_13","type":"book-chapter","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T07:18:26Z","timestamp":1219130306000},"page":"139-148","source":"Crossref","is-referenced-by-count":0,"title":["Vertex-Uncertainty in Graph-Problems"],"prefix":"10.1007","author":[{"given":"C\u00e9cile","family":"Murat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vangelis Th.","family":"Paschos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1016\/j.dam.2005.06.007","volume":"154","author":"C. Murat","year":"2006","unstructured":"Murat, C., Paschos, V.T.: On the probabilistic minimum coloring and minimum k-coloring. Discrete Appl. Math.\u00a0154, 564\u2013586 (2006)","journal-title":"Discrete Appl. Math."},{"key":"13_CR2","doi-asserted-by":"crossref","DOI":"10.1002\/9780470612507","volume-title":"Probabilistic combinatorial optimization on graphs","author":"C. Murat","year":"2006","unstructured":"Murat, C., Paschos, V.T.: Probabilistic combinatorial optimization on graphs. ISTE and Herm\u00e8s Science Publishing, London (2006)"},{"key":"13_CR3","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1287\/opre.38.6.1019","volume":"38","author":"D.J. Bertsimas","year":"1990","unstructured":"Bertsimas, D.J., Jaillet, P., Odoni, A.: A priori optimization. Oper. Res.\u00a038, 1019\u20131033 (1990)","journal-title":"Oper. Res."},{"key":"13_CR4","doi-asserted-by":"publisher","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\u00a041, 973\u2013989 (1994)","journal-title":"Naval Res. Logistics"},{"key":"13_CR5","volume-title":"Probabilistic combinatorial optimization problems. Phd thesis, Operations Research Center","author":"D.J. Bertsimas","year":"1988","unstructured":"Bertsimas, D.J.: Probabilistic combinatorial optimization problems. Phd thesis, Operations Research Center. MIT, Cambridge Mass., USA (1988)"},{"key":"13_CR6","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1287\/trsc.23.3.184","volume":"3","author":"D.J. Bertsimas","year":"1989","unstructured":"Bertsimas, D.J.: On probabilistic traveling salesman facility location problems. Transportation Sci.\u00a03, 184\u2013191 (1989)","journal-title":"Transportation Sci."},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1002\/net.3230200302","volume":"20","author":"D.J. Bertsimas","year":"1990","unstructured":"Bertsimas, D.J.: The probabilistic minimum spanning tree problem. Networks\u00a020, 245\u2013275 (1990)","journal-title":"Networks"},{"key":"13_CR8","unstructured":"Jaillet, P.: Probabilistic traveling salesman problem. Technical Report 185, Operations Research Center. MIT, Cambridge Mass., USA (1985)"},{"key":"13_CR9","doi-asserted-by":"publisher","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.\u00a036, 929\u2013936 (1988)","journal-title":"Oper. Res."},{"key":"13_CR10","doi-asserted-by":"publisher","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\u00a022, 589\u2013605 (1992)","journal-title":"Networks"},{"key":"13_CR11","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":"13_CR12","doi-asserted-by":"publisher","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: correction to the 2-p-opt and 1-shift algorithms. European J.\u00a0Oper. Res.\u00a0161, 206\u2013219 (2005)","journal-title":"European J.\u00a0Oper. Res."},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1111\/1475-3995.00338","volume":"9","author":"C. Murat","year":"2002","unstructured":"Murat, C., Paschos, V.T.: The probabilistic minimum vertex-covering problem. Int. Trans. Opl Res.\u00a09, 19\u201332 (2002), Preliminary version, \n                  \n                    http:\/\/www.lamsade.dauphine.fr\/~paschos\/documents\/c170.pdf","journal-title":"Int. Trans. Opl Res."},{"key":"13_CR14","unstructured":"Bourgeois, N., Della Croce, F., Escoffier, B., Murat, C., Paschos, V.T.: Probabilistic coloring of bipartite and split graphs. J. Comb. Optimization (to appear)"},{"key":"13_CR15","doi-asserted-by":"publisher","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.T.: The probabilistic longest path problem. Networks\u00a033, 207\u2013219 (1999)","journal-title":"Networks"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1016\/S0304-3975(01)00005-6","volume":"270","author":"C. Murat","year":"2002","unstructured":"Murat, C., Paschos, V.T.: A priori optimization for the probabilistic maximum independent set problem. Theoret. Comput. Sci.\u00a0270, 561\u2013590 (2002), \n                  \n                    http:\/\/www.lamsade.dauphine.fr\/~paschos\/documents\/c166.pdf","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-540-73556-4_14","volume-title":"Combinatorial Optimization and Applications","author":"V.T. Paschos","year":"2007","unstructured":"Paschos, V.T., Telelis, O.A., Zissimopoulos, V.: Steiner forests on stochastic metric graphs. In: Dress, A., Xu, Y., Zhu, B. (eds.) COCOA. LNCS, vol.\u00a04616, pp. 112\u2013123. Springer, Heidelberg (2007)"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1016\/0377-2217(95)00240-5","volume":"87","author":"M. Bellalouna","year":"1995","unstructured":"Bellalouna, M., Murat, C., Paschos, V.T.: Probabilistic combinatorial optimization problems: a new domain in operational research. European J.\u00a0Oper. Res.\u00a087, 693\u2013706 (1995)","journal-title":"European J.\u00a0Oper. Res."},{"key":"13_CR19","first-page":"221","volume-title":"Optimisation combinatoire\u00a0: concepts avanc\u00e9s","author":"C. Murat","year":"2005","unstructured":"Murat, C., Paschos, V.T.: L\u2019optimisation combinatoire probabiliste. In: Paschos, V.T. (ed.) Optimisation combinatoire\u00a0: concepts avanc\u00e9s, pp. 221\u2013247. Herm\u00e8s Science, Paris (2005)"},{"key":"13_CR20","unstructured":"Murat, C., Paschos, V.T.: What about future? Robustness under vertex-uncertainty in graph-problems. Cahier du LAMSADE 236, LAMSADE, Universit\u00e9 Paris-Dauphine (2006), \n                  \n                    http:\/\/www.lamsade.dauphine.fr\/~paschos\/documents\/pcopclassifcah.pdf"},{"key":"13_CR21","volume-title":"Combinatorial optimization problems and their approximability properties","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and approximation. In: Combinatorial optimization problems and their approximability properties. Springer, Berlin (1999)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85097-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T05:15:04Z","timestamp":1578546904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85097-7_13"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540850960","9783540850977"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85097-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}