{"id":"https://openalex.org/W1985036904","doi":"https://doi.org/10.1137/1033048","title":"Some Recent Advances in Network Flows","display_name":"Some Recent Advances in Network Flows","publication_year":1991,"publication_date":"1991-06-01","ids":{"openalex":"https://openalex.org/W1985036904","doi":"https://doi.org/10.1137/1033048","mag":"1985036904"},"language":"en","primary_location":{"id":"doi:10.1137/1033048","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1033048","pdf_url":null,"source":{"id":"https://openalex.org/S160107561","display_name":"SIAM Review","issn_l":"0036-1445","issn":["0036-1445","1095-7200"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Review","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/A5106764134","display_name":"Ravindra K. Ahuja","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ravindra K. Ahuja","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023919615","display_name":"Thomas L. Magnanti","orcid":"https://orcid.org/0000-0002-0771-3850"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Thomas L. Magnanti","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5072685560","display_name":"James B. Orlin","orcid":"https://orcid.org/0000-0002-7488-094X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"James B. Orlin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.5563,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.8900917,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"33","issue":"2","first_page":"175","last_page":"219"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.998199999332428,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.998199999332428,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9891999959945679,"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/T11598","display_name":"Internet Traffic Analysis and Secure E-voting","score":0.9873999953269958,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.8855956196784973},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.696661114692688},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.6714017391204834},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6389675140380859},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6086326837539673},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.5385668277740479},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5222336053848267},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.4542030990123749},{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.4517119526863098},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40522897243499756},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.27225202322006226},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2707565426826477}],"concepts":[{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.8855956196784973},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.696661114692688},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.6714017391204834},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6389675140380859},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6086326837539673},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.5385668277740479},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5222336053848267},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4542030990123749},{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.4517119526863098},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40522897243499756},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.27225202322006226},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2707565426826477},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/1033048","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1033048","pdf_url":null,"source":{"id":"https://openalex.org/S160107561","display_name":"SIAM Review","issn_l":"0036-1445","issn":["0036-1445","1095-7200"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Review","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.4099999964237213,"id":"https://metadata.un.org/sdg/9"}],"awards":[{"id":"https://openalex.org/G6225380263","display_name":"Presidential Young Investigators Award: Combinatorial       Optimization Problems","funder_award_id":"8451517","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W835219510","https://openalex.org/W1513400187","https://openalex.org/W1655990431","https://openalex.org/W1964416868","https://openalex.org/W1970394074","https://openalex.org/W1977421134","https://openalex.org/W1991295190","https://openalex.org/W2000558287","https://openalex.org/W2006006123","https://openalex.org/W2007470648","https://openalex.org/W2018804864","https://openalex.org/W2022980325","https://openalex.org/W2025535442","https://openalex.org/W2029266474","https://openalex.org/W2046043928","https://openalex.org/W2048790997","https://openalex.org/W2053760675","https://openalex.org/W2058605898","https://openalex.org/W2061670230","https://openalex.org/W2069916913","https://openalex.org/W2071326686","https://openalex.org/W2075322358","https://openalex.org/W2081013866","https://openalex.org/W2084224084","https://openalex.org/W2085917651","https://openalex.org/W2090747326","https://openalex.org/W2091084079","https://openalex.org/W2109567578","https://openalex.org/W2125690626","https://openalex.org/W2139559590","https://openalex.org/W2149342630","https://openalex.org/W2150154671","https://openalex.org/W2154501376","https://openalex.org/W2156036190","https://openalex.org/W2157503827","https://openalex.org/W2160365857","https://openalex.org/W2161078579","https://openalex.org/W2166541787","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W2467648627","https://openalex.org/W2475478067","https://openalex.org/W4213060883"],"related_works":["https://openalex.org/W3141113327","https://openalex.org/W4206915070","https://openalex.org/W3000598246","https://openalex.org/W2051329268","https://openalex.org/W4381333972","https://openalex.org/W3159013657","https://openalex.org/W1561045713","https://openalex.org/W184565551","https://openalex.org/W2590727506","https://openalex.org/W2069541586"],"abstract_inverted_index":{"The":[0,107],"literature":[1],"on":[2,110],"network":[3,37,104],"flow":[4,38,105,134,140,167,178],"problems":[5,39],"is":[6,121],"extensive,":[7],"and":[8,80,86,98,120,136,169],"over":[9,40],"the":[10,28,33,41,68,81,111,117,124,128,132,137,152,157,165,170,175],"past":[11,42],"40":[12],"years":[13,44],"researchers":[14,59],"have":[15,51],"made":[16],"continuous":[17],"improvements":[18],"to":[19,53,60,123],"algorithms":[20,115,144,163,173],"for":[21,156,164,174],"solving":[22],"several":[23],"classes":[24],"of":[25,30,36,67,74,83,95,113],"problems.":[26],"However,":[27],"surge":[29],"activity":[31],"concerning":[32],"algorithmic":[34],"aspects":[35],"few":[43],"has":[45],"been":[46],"particularly":[47],"striking.":[48],"Several":[49,142],"techniques":[50,97],"proven":[52],"be":[54],"very":[55],"successful":[56],"in":[57,101],"permitting":[58],"make":[61],"these":[62,96],"recent":[63],"contributions:":[64],"(i)":[65],"scaling":[66],"problem":[69,147],"data;":[70],"(ii)":[71],"improved":[72],"analysis":[73],"algorithms,":[75],"especially":[76],"amortized":[77],"worst-case":[78,118],"performance":[79],"use":[82],"potential":[84],"functions;":[85],"(iii)":[87],"enhanced":[88],"data":[89],"structures.":[90],"This":[91],"survey":[92],"illustrates":[93],"some":[94],"their":[99],"usefulness":[100],"developing":[102],"faster":[103,114],"algorithms.":[106],"discussion":[108],"focuses":[109],"design":[112],"from":[116,145],"perspective,":[119],"limited":[122],"following":[125],"fundamental":[126],"problems:":[127],"shortest":[129,158],"path":[130,159],"problem,":[131,135,160,168],"maximum":[133,166],"minimum":[138,176],"cost":[139,177],"problem.":[141,179],"representative":[143],"each":[146],"class":[148],"are":[149],"considered,":[150],"including":[151],"radix":[153],"heap":[154],"algorithm":[155],"preflow":[161],"push":[162,172],"pseudoflow":[171]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}