{"id":"https://openalex.org/W2047001449","doi":"https://doi.org/10.1137/0218039","title":"Note on Weintraub\u2019s Minimum-Cost Circulation Algorithm","display_name":"Note on Weintraub\u2019s Minimum-Cost Circulation Algorithm","publication_year":1989,"publication_date":"1989-06-01","ids":{"openalex":"https://openalex.org/W2047001449","doi":"https://doi.org/10.1137/0218039","mag":"2047001449"},"language":"en","primary_location":{"id":"doi:10.1137/0218039","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218039","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Journal on Computing","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/A5076877502","display_name":"Francisco Barahona","orcid":"https://orcid.org/0000-0002-4829-7515"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Francisco Barahona","raw_affiliation_strings":["Univ. of Waterloo,Waterloo,Ont.,Canada"],"affiliations":[{"raw_affiliation_string":"Univ. of Waterloo,Waterloo,Ont.,Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025175846","display_name":"\u00c9va Tardos","orcid":"https://orcid.org/0000-0002-2978-1475"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"\u00e9va Tardos","raw_affiliation_strings":["Eo\u00a8tvo\u00a8s Univ., Budapest, Hungary and Massachusetts Institute of Technology, Cambridge#TAB#"],"affiliations":[{"raw_affiliation_string":"Eo\u00a8tvo\u00a8s Univ., Budapest, Hungary and Massachusetts Institute of Technology, Cambridge#TAB#","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5076877502"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":null,"apc_paid":null,"fwci":1.4455,"has_fulltext":false,"cited_by_count":51,"citation_normalized_percentile":{"value":0.84907658,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"18","issue":"3","first_page":"579","last_page":"583"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9994000196456909,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991000294685364,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9836999773979187,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.6034303307533264},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5969566106796265},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5123356580734253},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4951085150241852},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48355743288993835},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.44975346326828003},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.33365416526794434},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32902443408966064},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32316356897354126}],"concepts":[{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.6034303307533264},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5969566106796265},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5123356580734253},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4951085150241852},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48355743288993835},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.44975346326828003},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.33365416526794434},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32902443408966064},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32316356897354126},{"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0218039","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218039","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Journal on Computing","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":6,"referenced_works":["https://openalex.org/W1513400187","https://openalex.org/W1993305973","https://openalex.org/W2125690626","https://openalex.org/W2149342630","https://openalex.org/W2150154671","https://openalex.org/W2166541787"],"related_works":["https://openalex.org/W3141113327","https://openalex.org/W2080904092","https://openalex.org/W3035974271","https://openalex.org/W3161514703","https://openalex.org/W3207627914","https://openalex.org/W2270959725","https://openalex.org/W2151525839","https://openalex.org/W648253840","https://openalex.org/W2051329268","https://openalex.org/W2092572272"],"abstract_inverted_index":{"In":[0,21],"1974":[1],"Weintraub":[2],"[Management":[3],"Sci.,":[4],"21":[5],"(1974),":[6],"pp.":[7,87],"87\u201397]":[8],"published":[9,130],"an":[10],"algorithm":[11,25,48,75,101,118,128],"for":[12],"the":[13,47,72,92,97,107,117,137],"minimum-cost":[14,32,109],"circulation":[15,33,110],"problems":[16],"with":[17,35],"convex":[18],"cost":[19],"function.":[20,38],"this":[22],"note":[23],"Weintraub\u2019s":[24],"is":[26,40,58,68,104,119],"considered":[27],"when":[28],"applied":[29],"to":[30,77,136],"a":[31,43,69,122],"problem":[34],"linear":[36],"objective":[37],"It":[39,67],"shown":[41],"that":[42,89],"minor":[44],"variation":[45],"of":[46,71],"runs":[49],"in":[50,96,116,131],"polynomial":[51,126],"time.":[52],"The":[53,100,113],"resulting":[54],"algorithm,":[55],"although":[56],"it":[57],"not":[59,63],"strongly":[60],"polynomial,":[61],"does":[62],"rely":[64],"on":[65],"scaling.":[66],"generalization":[70],"maximum":[73],"flow":[74],"due":[76,135],"Edmonds":[78],"and":[79,133],"Karp":[80],"[J.":[81],"Assoc.":[82],"Comput.":[83],"Mach.,":[84],"19":[85],"(1972),":[86],"248\u2013264]":[88],"augments":[90],"along":[91],"fattest":[93],"augmenting":[94],"path":[95],"residual":[98],"graph.":[99],"described":[102],"here":[103],"slower":[105],"than":[106],"fastest":[108],"algorithms":[111],"known.":[112],"authors\u2019":[114],"interest":[115],"partially":[120,134],"historical,":[121],"scaling":[123],"free":[124],"\u201calmost":[125],"time\u201d":[127],"was":[129],"1974,":[132],"different":[138],"ideas":[139],"involved.":[140]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2019,"cited_by_count":15},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}