{"id":"https://openalex.org/W2041809674","doi":"https://doi.org/10.1002/net.3230030105","title":"The shortest and the K\u2010shortest routes as assignment problems","display_name":"The shortest and the K\u2010shortest routes as assignment problems","publication_year":1973,"publication_date":"1973-01-01","ids":{"openalex":"https://openalex.org/W2041809674","doi":"https://doi.org/10.1002/net.3230030105","mag":"2041809674"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230030105","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230030105","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/A5004756987","display_name":"Andr\u00e9s Weintraub","orcid":"https://orcid.org/0000-0003-0440-0311"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"A. Weintraub","raw_affiliation_strings":["University of California Berkeley, California","University of California, Berkeley, California"],"affiliations":[{"raw_affiliation_string":"University of California Berkeley, California","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"University of California, Berkeley, California","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5004756987"],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":2.066,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.86048605,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"3","issue":"1","first_page":"61","last_page":"73"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9204000234603882,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9204000234603882,"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"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9144999980926514,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7517364025115967},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5600712299346924},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5562324523925781},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5519435405731201},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5373908877372742},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5301680564880371},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.4748549461364746},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44182470440864563},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4365411102771759},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.43526333570480347},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3854433298110962},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3797033429145813},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.07829880714416504},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06630617380142212}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7517364025115967},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5600712299346924},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5562324523925781},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5519435405731201},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5373908877372742},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5301680564880371},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.4748549461364746},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44182470440864563},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4365411102771759},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.43526333570480347},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3854433298110962},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3797033429145813},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.07829880714416504},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06630617380142212},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230030105","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230030105","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":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.49000000953674316}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W4293054712","https://openalex.org/W2767202586","https://openalex.org/W2375775343","https://openalex.org/W2388654557","https://openalex.org/W2360981904","https://openalex.org/W2365712669","https://openalex.org/W2349797546","https://openalex.org/W2161960576","https://openalex.org/W3013845525"],"abstract_inverted_index":{"Abstract":[0],"The":[1,25],"problem":[2,20],"of":[3,31,49,67,103,147,159],"finding":[4],"a":[5,9,89,104,120],"shortest":[6,90],"route":[7,91],"in":[8,43,108,163],"network":[10,58],"with":[11],"unrestricted":[12],"costs":[13,95],"is":[14,38,51,81,84,92],"approached":[15],"through":[16],"solving":[17],"an":[18],"assignment":[19],"associated":[21],"to":[22,141,156],"the":[23,29,36,46,94,145,148,152],"network.":[24],"upper":[26,157],"bound":[27],"on":[28,56,96],"number":[30,48,72],"elementary":[32,116],"calculations":[33,117],"required":[34],"for":[35,132],"solution":[37],"0(m":[39,75,113],"3":[40,161],").":[41,77],"However,":[42],"most":[44,112],"cases,":[45],"actual":[47],"computations":[50],"considerably":[52],"less":[53],"and":[54,151],"depends":[55],"different":[57],"characteristics":[59],"than":[60],"Dynamic":[61,128],"Programming":[62,129],"algorithms":[63,130],"do.":[64],"In":[65],"examples":[66],"networks":[68],"generated":[69],"stochastically,":[70],"this":[71],"was":[73],"below":[74],"2.5":[76],"A":[78],"parametric":[79],"analysis":[80],"presented.":[82],"It":[83],"shown":[85],"that":[86],"if":[87],"after":[88],"determined,":[93],"all":[97,135],"arcs":[98],"incident":[99],"into":[100],"or":[101],"out":[102],"node":[105],"are":[106],"modified":[107],"any":[109],"form,":[110],"at":[111],"2":[114],")":[115,162],"will":[118],"determine":[119],"new":[121],"optimal":[122],"solution.":[123],"This":[124],"feature,":[125],"shared":[126],"by":[127],"only":[131],"cases":[133],"where":[134],"cost":[136],"decrease,":[137],"can":[138],"be":[139],"applied":[140],"problems":[142],"such":[143],"as":[144],"determination":[146],"K\u2010shortest":[149],"routes":[150],"K\u2010smallest":[153],"assignments,":[154],"leading":[155],"bounds":[158],"0(Km":[160],"both":[164],"cases.":[165]},"counts_by_year":[{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}