{"id":"https://openalex.org/W2083129372","doi":"https://doi.org/10.1016/s0305-0548(02)00197-1","title":"The quickest path problem with interval lead times","display_name":"The quickest path problem with interval lead times","publication_year":2003,"publication_date":"2003-02-17","ids":{"openalex":"https://openalex.org/W2083129372","doi":"https://doi.org/10.1016/s0305-0548(02)00197-1","mag":"2083129372"},"language":"en","primary_location":{"id":"doi:10.1016/s0305-0548(02)00197-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(02)00197-1","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050556064","display_name":"Herminia I. Calvete","orcid":"https://orcid.org/0000-0001-7603-9380"},"institutions":[{"id":"https://openalex.org/I255234318","display_name":"Universidad de Zaragoza","ror":"https://ror.org/012a91z28","country_code":"ES","type":"education","lineage":["https://openalex.org/I255234318"]}],"countries":["ES"],"is_corresponding":true,"raw_author_name":"Herminia I. Calvete","raw_affiliation_strings":["Dpto. de M\u00e9todos Estad\u0131\u0301sticos, Edificio B, Universidad de Zaragoza, Pedro Cerbuna 12, 50009 Zaragoza, Spain"],"affiliations":[{"raw_affiliation_string":"Dpto. de M\u00e9todos Estad\u0131\u0301sticos, Edificio B, Universidad de Zaragoza, Pedro Cerbuna 12, 50009 Zaragoza, Spain","institution_ids":["https://openalex.org/I255234318"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5050556064"],"corresponding_institution_ids":["https://openalex.org/I255234318"],"apc_list":{"value":3210,"currency":"USD","value_usd":3210},"apc_paid":null,"fwci":0.2488,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.64320239,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"31","issue":"3","first_page":"383","last_page":"395"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12288","display_name":"Optimization and Search Problems","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9916999936103821,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9782000184059143,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.590022087097168},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.586648166179657},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5743070840835571},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5724042057991028},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5548852682113647},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.5216734409332275},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48118525743484497},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46309614181518555},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.42805173993110657},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4220016598701477},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3078765869140625},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.12060478329658508},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.11116868257522583},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.08511084318161011}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.590022087097168},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.586648166179657},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5743070840835571},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5724042057991028},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5548852682113647},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.5216734409332275},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48118525743484497},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46309614181518555},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.42805173993110657},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4220016598701477},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3078765869140625},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12060478329658508},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.11116868257522583},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08511084318161011},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0305-0548(02)00197-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(02)00197-1","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8100000023841858,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W25288802","https://openalex.org/W119169328","https://openalex.org/W1550531993","https://openalex.org/W1981882279","https://openalex.org/W1994909604","https://openalex.org/W1997102717","https://openalex.org/W2009054772","https://openalex.org/W2014156227","https://openalex.org/W2021468914","https://openalex.org/W2030129759","https://openalex.org/W2036737894","https://openalex.org/W2039773416","https://openalex.org/W2060349790","https://openalex.org/W2060924166","https://openalex.org/W2066047491","https://openalex.org/W2068113337","https://openalex.org/W2084623031","https://openalex.org/W2085041447","https://openalex.org/W2099466544","https://openalex.org/W2120974482","https://openalex.org/W2485591678","https://openalex.org/W6604902140"],"related_works":["https://openalex.org/W4293167680","https://openalex.org/W2776102956","https://openalex.org/W4382866750","https://openalex.org/W4387185483","https://openalex.org/W2022506245","https://openalex.org/W2040572217","https://openalex.org/W2388410942","https://openalex.org/W4385965963","https://openalex.org/W2600678155","https://openalex.org/W775001140"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}