{"id":"https://openalex.org/W2007917614","doi":"https://doi.org/10.1002/(sici)1097-0037(199905)33:3<207::aid-net7>3.0.co;2-7","title":"The probabilistic longest path problem","display_name":"The probabilistic longest path problem","publication_year":1999,"publication_date":"1999-05-01","ids":{"openalex":"https://openalex.org/W2007917614","doi":"https://doi.org/10.1002/(sici)1097-0037(199905)33:3<207::aid-net7>3.0.co;2-7","mag":"2007917614"},"language":"en","primary_location":{"id":"doi:10.1002/(sici)1097-0037(199905)33:3<207::aid-net7>3.0.co;2-7","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199905)33:3<207::aid-net7>3.0.co;2-7","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://basepub.dauphine.fr/handle/123456789/5780","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037346228","display_name":"C\u00e9cile Murat","orcid":"https://orcid.org/0000-0001-8888-3685"},"institutions":[{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"C\ufffdcile Murat","raw_affiliation_strings":["LAMSADE, Universite\u0301 Paris-Dauphine, Place du Mare\u0301chal De Lattre de Tassigny, 75775 Paris Cedex 16, France","LAMSADE, Universit\u00e9 Paris\u2010Dauphine, Place du Mar\u00e9chal De Lattre de Tassigny, 75775 Paris Cedex 16, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LAMSADE, Universite\u0301 Paris-Dauphine, Place du Mare\u0301chal De Lattre de Tassigny, 75775 Paris Cedex 16, France","institution_ids":["https://openalex.org/I56435720"]},{"raw_affiliation_string":"LAMSADE, Universit\u00e9 Paris\u2010Dauphine, Place du Mar\u00e9chal De Lattre de Tassigny, 75775 Paris Cedex 16, France","institution_ids":["https://openalex.org/I56435720"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111473903","display_name":"Vang\u00e9lis Th. Paschos","orcid":null},"institutions":[{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Vangelis Th. Paschos","raw_affiliation_strings":["LAMSADE, Universite\u0301 Paris-Dauphine, Place du Mare\u0301chal De Lattre de Tassigny, 75775 Paris Cedex 16, France","LAMSADE, Universit\u00e9 Paris\u2010Dauphine, Place du Mar\u00e9chal De Lattre de Tassigny, 75775 Paris Cedex 16, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LAMSADE, Universite\u0301 Paris-Dauphine, Place du Mare\u0301chal De Lattre de Tassigny, 75775 Paris Cedex 16, France","institution_ids":["https://openalex.org/I56435720"]},{"raw_affiliation_string":"LAMSADE, Universit\u00e9 Paris\u2010Dauphine, Place du Mar\u00e9chal De Lattre de Tassigny, 75775 Paris Cedex 16, France","institution_ids":["https://openalex.org/I56435720"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5111473903"],"corresponding_institution_ids":["https://openalex.org/I56435720"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.3568,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":{"value":0.62394319,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"33","issue":"3","first_page":"207","last_page":"219"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.8797369003295898},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6951375603675842},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6439793705940247},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5316798090934753},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.4142799377441406},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39358100295066833},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3349628448486328},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29016995429992676},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19091710448265076}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.8797369003295898},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6951375603675842},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6439793705940247},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5316798090934753},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.4142799377441406},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39358100295066833},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3349628448486328},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29016995429992676},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19091710448265076},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1002/(sici)1097-0037(199905)33:3<207::aid-net7>3.0.co;2-7","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0037(199905)33:3<207::aid-net7>3.0.co;2-7","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},{"id":"pmh:oai:basepub.dauphine.fr:123456789/5780","is_oa":true,"landing_page_url":"https://basepub.dauphine.fr/handle/123456789/5780","pdf_url":null,"source":{"id":"https://openalex.org/S4306401007","display_name":"Base Institutionnelle de Recherche de l'universit\u00e9 Paris-Dauphine (BIRD) (University Paris-Dauphine)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102197404","host_organization_name":"Universit\u00e9 Paris-Sud","host_organization_lineage":["https://openalex.org/I102197404"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Communication / Conf\u00e9rence"}],"best_oa_location":{"id":"pmh:oai:basepub.dauphine.fr:123456789/5780","is_oa":true,"landing_page_url":"https://basepub.dauphine.fr/handle/123456789/5780","pdf_url":null,"source":{"id":"https://openalex.org/S4306401007","display_name":"Base Institutionnelle de Recherche de l'universit\u00e9 Paris-Dauphine (BIRD) (University Paris-Dauphine)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102197404","host_organization_name":"Universit\u00e9 Paris-Sud","host_organization_lineage":["https://openalex.org/I102197404"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Communication / Conf\u00e9rence"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1576498301","https://openalex.org/W2011039300","https://openalex.org/W2014736580","https://openalex.org/W2085725603","https://openalex.org/W2143466467","https://openalex.org/W2162328434","https://openalex.org/W2290297265"],"related_works":["https://openalex.org/W2212155158","https://openalex.org/W2005440350","https://openalex.org/W4253814782","https://openalex.org/W2151965717","https://openalex.org/W2149447807","https://openalex.org/W2381469031","https://openalex.org/W2124090196","https://openalex.org/W88319588","https://openalex.org/W2096349874","https://openalex.org/W2498607216"],"abstract_inverted_index":{"We":[0,7],"study":[1],"the":[2,23,28,37,46],"probabilistic":[3,24],"longest":[4],"path":[5],"problem.":[6],"propose":[8],"a":[9,13,16,20],"modification":[10],"strategy":[11],"adapting":[12],"solution":[14,21,48],"for":[15,22],"deterministic":[17,47],"instance":[18],"to":[19],"one,":[25],"we":[26,35],"compute":[27],"functional":[29,42],"associated":[30],"with":[31],"this":[32,41],"strategy,":[33],"and":[34,43],"evaluate":[36],"complexities":[38],"of":[39,44],"computing":[40,45],"maximizing":[49],"it.":[50],"\u00a9":[51],"1999":[52,61],"John":[53],"Wiley":[54],"&":[55],"Sons,":[56],"Inc.":[57],"Networks":[58],"33:":[59],"207\u2013219,":[60]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}