{"id":"https://openalex.org/W1987152910","doi":"https://doi.org/10.1002/net.3230060402","title":"On optimum path problems","display_name":"On optimum path problems","publication_year":1976,"publication_date":"1976-01-01","ids":{"openalex":"https://openalex.org/W1987152910","doi":"https://doi.org/10.1002/net.3230060402","mag":"1987152910"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230060402","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230060402","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066873803","display_name":"Russell Thomas","orcid":null},"institutions":[{"id":"https://openalex.org/I72090969","display_name":"Nokia (United States)","ror":"https://ror.org/038km2573","country_code":"US","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I72090969"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"R. E. Thomas","raw_affiliation_strings":["Bell Telephone Laboratories Holmdel, New Jersey","Bell Telephone Laboratories Holmdel New Jersey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bell Telephone Laboratories Holmdel, New Jersey","institution_ids":[]},{"raw_affiliation_string":"Bell Telephone Laboratories Holmdel New Jersey","institution_ids":["https://openalex.org/I72090969"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5066873803"],"corresponding_institution_ids":["https://openalex.org/I72090969"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.6434,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.68558418,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"6","issue":"4","first_page":"287","last_page":"305"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12423","display_name":"Software Reliability and Analysis Research","score":0.9886000156402588,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9840999841690063,"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/path","display_name":"Path (computing)","score":0.7673181295394897},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.7430294752120972},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6417444944381714},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.632799506187439},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5634579658508301},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5610036849975586},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5491712689399719},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.42521360516548157},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39116787910461426},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33613675832748413},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.33059531450271606},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.19474604725837708},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.19022789597511292},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.10521706938743591}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7673181295394897},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7430294752120972},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6417444944381714},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.632799506187439},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5634579658508301},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5610036849975586},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5491712689399719},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.42521360516548157},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39116787910461426},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33613675832748413},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.33059531450271606},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.19474604725837708},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.19022789597511292},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.10521706938743591},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230060402","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230060402","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W106168664","https://openalex.org/W174827889","https://openalex.org/W1551635709","https://openalex.org/W1964119857","https://openalex.org/W1965680834","https://openalex.org/W2007572995","https://openalex.org/W2017927472","https://openalex.org/W2086709935","https://openalex.org/W2148673189","https://openalex.org/W2154434560","https://openalex.org/W2169528473","https://openalex.org/W2563307704","https://openalex.org/W4213214460","https://openalex.org/W4244424643","https://openalex.org/W6681754254"],"related_works":["https://openalex.org/W4382866750","https://openalex.org/W4293167680","https://openalex.org/W2776102956","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/W2018146256"],"abstract_inverted_index":{"Abstract":[0],"This":[1,49],"tutorial":[2],"paper":[3,50],"is":[4],"concerned":[5],"with":[6,18,21,29,95],"network":[7],"problems":[8,53],"characterized":[9],"as":[10,43],"finding":[11],"optimum":[12,23,82,93],"paths":[13,26],"in":[14],"given":[15,22],"networks":[16,20,94],"and":[17,54,79],"synthesizing":[19],"paths.":[24],"Optimum":[25],"are":[27],"best":[28],"respect":[30],"to":[31,85],"path":[32,36,41,83],"weights":[33,37],"where":[34],"the":[35,55,90],"can":[38],"represent":[39],"such\u2010diverse":[40],"parameters":[42],"distances,":[44],"costs,":[45],"flows,":[46],"or":[47,69],"reliabilities.":[48,98],"surveys":[51],"these":[52],"known":[56,81],"results":[57,84,88],"by":[58],"considering":[59],"specific":[60],"but":[61],"simple":[62],"generic":[63],"examples":[64],"while":[65],"avoiding":[66],"any":[67],"detailed":[68],"rigorous":[70],"proofs.":[71],"The":[72],"final":[73],"example":[74],"uses":[75],"a":[76],"mathematical":[77],"equivalence":[78],"combines":[80],"obtain":[86],"new":[87],"regarding":[89],"synthesis":[91],"of":[92],"specified":[96],"point\u2010to\u2010point":[97]},"counts_by_year":[],"updated_date":"2026-05-21T09:19:25.381259","created_date":"2025-10-10T00:00:00"}