{"id":"https://openalex.org/W564623216","doi":null,"title":"EQUILIBRIUM FLOWS IN A NETWORK WITH CONGESTED LINKS","display_name":"EQUILIBRIUM FLOWS IN A NETWORK WITH CONGESTED LINKS","publication_year":1984,"publication_date":"1984-01-01","ids":{"openalex":"https://openalex.org/W564623216","mag":"564623216"},"language":"en","primary_location":{"id":"mag:564623216","doi":null,"is_oa":false,"landing_page_url":"https://trid.trb.org/view/210834","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5064037789","display_name":"Iwao Okutani","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Iwao Okutani","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5064037789"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":16.3554,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.98378192,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9628999829292297,"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.9628999829292297,"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/T10524","display_name":"Traffic control and management","score":0.015399999916553497,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T12709","display_name":"Optimization and Mathematical Programming","score":0.0026000000070780516,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/traffic-assignment","display_name":"traffic assignment","score":0.8880000114440918},{"id":"https://openalex.org/keywords/equilibrium-flow","display_name":"equilibrium flow","score":0.48899999260902405},{"id":"https://openalex.org/keywords/link-capacity-constraints","display_name":"link capacity constraints","score":0.8610000014305115},{"id":"https://openalex.org/keywords/network-flow-optimization","display_name":"network flow optimization","score":0.4339999854564667},{"id":"https://openalex.org/keywords/dual-problem","display_name":"dual problem","score":0.7839999794960022},{"id":"https://openalex.org/keywords/origin-destination-pairs","display_name":"origin-destination pairs","score":0.6489999890327454}],"concepts":[{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.7138251066207886},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.6847383379936218},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.6829856038093567},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5370643734931946},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.5347484946250916},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5329115390777588},{"id":"https://openalex.org/C207512268","wikidata":"https://www.wikidata.org/wiki/Q3074551","display_name":"Traffic flow (computer networking)","level":2,"score":0.4763776957988739},{"id":"https://openalex.org/C7321624","wikidata":"https://www.wikidata.org/wiki/Q205","display_name":"Infinity","level":2,"score":0.44727733731269836},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44671982526779175},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.37431085109710693},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3599187433719635},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.12932464480400085},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.12479168176651001},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:564623216","doi":null,"is_oa":false,"landing_page_url":"https://trid.trb.org/view/210834","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.4943999946117401}],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2370341730","https://openalex.org/W2025626477","https://openalex.org/W627971087","https://openalex.org/W4236282149","https://openalex.org/W2250029315","https://openalex.org/W2321873446","https://openalex.org/W63933690","https://openalex.org/W3031017702","https://openalex.org/W2954566054","https://openalex.org/W7100205778"],"abstract_inverted_index":{"The":[0],"existing":[1],"traffic":[2],"assignment":[3],"technique":[4],"which":[5,32],"employs":[6],"a":[7],"link":[8],"cost":[9],"function,":[10],"f(x),":[11],"such":[12],"that":[13],"f(x)":[14],"tends":[15],"to":[16,29,40,99,113],"infinity":[17],"as":[18],"the":[19,22,30,41,48,58,64,68,73,80,102,115,120,128,136,154,159],"flow":[20,50,65,70,82,117,122,130,161],"approaches":[21],"capacity":[23,38],"only":[24],"yields":[25],"an":[26],"approximate":[27],"solution":[28,75,110],"problem":[31],"is":[33,53,66,97,111,124,132,141],"produced":[34],"by":[35],"adding":[36],"explicit":[37],"restraints":[39],"mathematical":[42],"programming":[43],"problem,":[44,104],"p-1,":[45],"for":[46],"obtaining":[47],"equilibrium":[49,81,116,129],"pattern.":[51,118],"P-1":[52],"not":[54,133,142],"necessarily":[55],"effective":[56],"if":[57,84],"network":[59],"involves":[60],"some":[61],"link(s)":[62],"where":[63],"in":[67,158],"congested":[69,121,160],"regime":[71,123],"since":[72,135],"maximum":[74,109],"of":[76,106,139,156],"p-1":[77,107],"can":[78,147],"offer":[79,114],"pattern":[83,131],"all":[85],"paths":[86],"between":[87],"each":[88],"origin-destination":[89],"pair":[90],"are":[91],"utilized.":[92],"For":[93],"this":[94],"reason":[95],"it":[96],"proposed":[98],"deal":[100],"with":[101],"dual":[103],"d-1,":[105],"whose":[108],"proved":[112],"If":[119],"taken":[125],"into":[126],"account,":[127],"unique":[134],"objective":[137],"function":[138],"d-1":[140],"concave":[143],"and":[144],"further":[145],"we":[146],"produce":[148],"many":[149],"different":[150],"d-1's":[151],"depending":[152],"on":[153],"combinations":[155],"links":[157],"regime.":[162],"(Author/TRRL)":[163]},"counts_by_year":[],"updated_date":"2025-11-06T04:12:42.849631","created_date":"2016-06-24T00:00:00"}