{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,23]],"date-time":"2023-11-23T13:00:58Z","timestamp":1700744458423},"reference-count":10,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":5967,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1999,5]]},"DOI":"10.1002\/(sici)1097-0037(199905)33:3<207::aid-net7>3.0.co;2-7","type":"journal-article","created":{"date-parts":[[2004,11,14]],"date-time":"2004-11-14T19:38:44Z","timestamp":1100461124000},"page":"207-219","source":"Crossref","is-referenced-by-count":20,"title":["The probabilistic longest path problem"],"prefix":"10.1002","volume":"33","author":[{"given":"C\ufffdcile","family":"Murat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vangelis Th.","family":"Paschos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"10.1002\/(SICI)1097-0037(199905)33:3<207::AID-NET7>3.0.CO;2-7-BIB1","author":"Bellalouna","year":"1993","unstructured":"Probl\u00e8mes d'optimisation combinatoires probabilistes, Ph.D. Thesis, Centre de Recherche en Math\u00e9matiques Appliqu\u00e9es, Ecole Nationale des Ponts et Chauss\u00e9es, Paris, France, 1993."},{"key":"10.1002\/(SICI)1097-0037(199905)33:3<207::AID-NET7>3.0.CO;2-7-BIB2","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1016\/0377-2217(95)00240-5","volume":"87","author":"Bellalouna","year":"1995","journal-title":"Eur J Oper Res"},{"key":"10.1002\/(SICI)1097-0037(199905)33:3<207::AID-NET7>3.0.CO;2-7-BIB3","author":"Bertsimas","year":"1988","unstructured":"Probabilistic combinatorial optimization problems, Ph.D. Thesis, Operations Research Center, MIT, Cambridge, MA, 1988."},{"key":"10.1002\/(SICI)1097-0037(199905)33:3<207::AID-NET7>3.0.CO;2-7-BIB4","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1287\/opre.38.6.1019","volume":"38","author":"Bertsimas","year":"1990","journal-title":"Oper Res"},{"key":"10.1002\/(SICI)1097-0037(199905)33:3<207::AID-NET7>3.0.CO;2-7-BIB5","author":"Bjornsson","year":"1997","unstructured":"and Comparability graph page, available on _address: http:\/\/www.cs.ualberta.ca\/?bing\/GRAPH\/comparability, 1997."},{"key":"10.1002\/(SICI)1097-0037(199905)33:3<207::AID-NET7>3.0.CO;2-7-BIB6","first-page":"33","volume":"90","author":"Cai","year":"1992","journal-title":"Congr Numer"},{"key":"10.1002\/(SICI)1097-0037(199905)33:3<207::AID-NET7>3.0.CO;2-7-BIB7","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1023\/A:1018920709696","volume":"69","author":"Gabrel","year":"1997","journal-title":"Ann Oper Res"},{"key":"10.1002\/(SICI)1097-0037(199905)33:3<207::AID-NET7>3.0.CO;2-7-BIB8","volume-title":"Computers and intractability. A guide to the theory of NP-completeness","author":"Garey","year":"1979","unstructured":"and Computers and intractability. A guide to the theory of NP-completeness, W.H. Freeman, San Francisco, CA, 1979."},{"key":"10.1002\/(SICI)1097-0037(199905)33:3<207::AID-NET7>3.0.CO;2-7-BIB9","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1002\/net.3230220607","volume":"22","author":"Jaillet","year":"1992","journal-title":"Networks"},{"key":"10.1002\/(SICI)1097-0037(199905)33:3<207::AID-NET7>3.0.CO;2-7-BIB10","first-page":"420","year":"1995","unstructured":"C. Murat and V.Th. Paschos, The probabilistic maximum independent set problem, Proc Applied Stochastic Models and Data Analysis, 1995, pp. 420-429."}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2F(SICI)1097-0037(199905)33:3%3C207::AID-NET7%3E3.0.CO;2-7","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/(SICI)1097-0037(199905)33:3%3C207::AID-NET7%3E3.0.CO;2-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T10:11:03Z","timestamp":1625134263000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/(SICI)1097-0037(199905)33:3<207::AID-NET7>3.0.CO;2-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,5]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,5]]}},"URL":"https:\/\/doi.org\/10.1002\/(sici)1097-0037(199905)33:3<207::aid-net7>3.0.co;2-7","relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,5]]}}}