乐胖代购免代理版

{"id":"https://openalex.org/W2057451201","doi":"https://doi.org/10.1016/j.cor.2015.01.001","title":"PH-graphs for analyzing shortest path problems with correlated traveling times","display_name":"PH-graphs for analyzing shortest path problems with correlated traveling times","publication_year":2015,"publication_date":"2015-01-21","ids":{"openalex":"https://openalex.org/W2057451201","doi":"https://doi.org/10.1016/j.cor.2015.01.001","mag":"2057451201"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.cor.2015.01.001","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_indexed_in_scopus":true,"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":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5022119933","display_name":"Peter Buchholz","orcid":"https://orcid.org/0000-0002-9966-7686"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"funder","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Peter Buchholz","raw_affiliation_strings":["Informatik IV TU Dortmund D\u201044221 Dortmund Germany"],"affiliations":[{"raw_affiliation_string":"Informatik IV TU Dortmund D\u201044221 Dortmund Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110907159","display_name":"Iryna Felko","orcid":null},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"funder","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Iryna Felko","raw_affiliation_strings":["Informatik IV TU Dortmund D\u201044221 Dortmund Germany"],"affiliations":[{"raw_affiliation_string":"Informatik IV TU Dortmund D\u201044221 Dortmund Germany","institution_ids":["https://openalex.org/I200332995"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3210,"currency":"USD","value_usd":3210},"apc_paid":null,"fwci":1.652,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.770599,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":82,"max":83},"biblio":{"volume":"59","issue":null,"first_page":"51","last_page":"65"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9983,"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"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9983,"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/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9922,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.9907,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.81717384},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.563817},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5420431},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5240538},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5088039},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5083844},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5031025},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.47241083},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46423593},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.44397306},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.435445},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.43244886},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35031545},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2836184},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.20209065},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.096603304},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.06909725},{"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":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.cor.2015.01.001","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_indexed_in_scopus":true,"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":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, justice, and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.72}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":54,"referenced_works":["https://openalex.org/W1498478441","https://openalex.org/W1506342804","https://openalex.org/W1530547402","https://openalex.org/W1570713732","https://openalex.org/W1581520665","https://openalex.org/W1604276976","https://openalex.org/W1964680067","https://openalex.org/W1976699101","https://openalex.org/W1984121732","https://openalex.org/W1988324242","https://openalex.org/W1992876208","https://openalex.org/W1996527419","https://openalex.org/W2026701266","https://openalex.org/W2034204928","https://openalex.org/W2039114216","https://openalex.org/W2041942953","https://openalex.org/W2042836861","https://openalex.org/W2050441104","https://openalex.org/W2057742448","https://openalex.org/W2066906122","https://openalex.org/W2069596643","https://openalex.org/W2073424933","https://openalex.org/W2075379212","https://openalex.org/W2081287319","https://openalex.org/W2085400727","https://openalex.org/W2088823298","https://openalex.org/W2093878537","https://openalex.org/W2098432798","https://openalex.org/W2100851133","https://openalex.org/W2101969505","https://openalex.org/W2108234048","https://openalex.org/W2108871931","https://openalex.org/W2110167495","https://openalex.org/W2114936722","https://openalex.org/W2119702428","https://openalex.org/W2122372969","https://openalex.org/W2132863287","https://openalex.org/W2133991852","https://openalex.org/W2143002993","https://openalex.org/W2154602821","https://openalex.org/W2157647437","https://openalex.org/W2163279392","https://openalex.org/W2164799550","https://openalex.org/W2167395111","https://openalex.org/W2168945108","https://openalex.org/W2169528473","https://openalex.org/W2170903322","https://openalex.org/W2171856993","https://openalex.org/W2334782222","https://openalex.org/W2608728242","https://openalex.org/W5657644","https://openalex.org/W6145922","https://openalex.org/W61891032","https://openalex.org/W73143588"],"related_works":["https://openalex.org/W4293054712","https://openalex.org/W2767202586","https://openalex.org/W2388410942","https://openalex.org/W2375775343","https://openalex.org/W2360981904","https://openalex.org/W2198982833","https://openalex.org/W2156431668","https://openalex.org/W2040572217","https://openalex.org/W2030169809","https://openalex.org/W2018146256"],"abstract_inverted_index":null,"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2057451201","counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":4}],"updated_date":"2025-04-19T22:29:11.247141","created_date":"2016-06-24"}