{"id":"https://openalex.org/W2069324954","doi":"https://doi.org/10.1007/bf01580604","title":"A polynomial-time simplex method for the maximumk-flow problem","display_name":"A polynomial-time simplex method for the maximumk-flow problem","publication_year":1993,"publication_date":"1993-06-01","ids":{"openalex":"https://openalex.org/W2069324954","doi":"https://doi.org/10.1007/bf01580604","mag":"2069324954"},"language":"en","primary_location":{"id":"doi:10.1007/bf01580604","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01580604","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","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/A5030393931","display_name":"Donald K. Wagner","orcid":null},"institutions":[{"id":"https://openalex.org/I175003984","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57","country_code":"US","type":"funder","lineage":["https://openalex.org/I1330347796","https://openalex.org/I175003984","https://openalex.org/I3130687028"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Donald K. Wagner","raw_affiliation_strings":["Mathematical Sciences Division, Office of Naval Research, 800 North Quincy Street, 22217-5000, Arlington, VA, USA","Mathematical Sciences Division, Office of Naval Research, Arlington, USA"],"affiliations":[{"raw_affiliation_string":"Mathematical Sciences Division, Office of Naval Research, 800 North Quincy Street, 22217-5000, Arlington, VA, USA","institution_ids":["https://openalex.org/I175003984"]},{"raw_affiliation_string":"Mathematical Sciences Division, Office of Naval Research, Arlington, USA","institution_ids":["https://openalex.org/I175003984"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000660580","display_name":"Hong Hao Wan","orcid":null},"institutions":[{"id":"https://openalex.org/I2800773976","display_name":"The Ohio State University at Mansfield","ror":"https://ror.org/05h8s0v03","country_code":"US","type":"education","lineage":["https://openalex.org/I2800773976","https://openalex.org/I52357470"]},{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hong Wan","raw_affiliation_strings":["Department of Mathematics, Ohio State University at Mansfield, OH, USA","Department of Mathematics, Ohio State University at Mansfield, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Ohio State University at Mansfield, OH, USA","institution_ids":["https://openalex.org/I2800773976"]},{"raw_affiliation_string":"Department of Mathematics, Ohio State University at Mansfield, USA","institution_ids":["https://openalex.org/I52357470"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5030393931"],"corresponding_institution_ids":["https://openalex.org/I175003984"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.5357,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.67214727,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"60","issue":"1-3","first_page":"115","last_page":"123"},"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.9830999970436096,"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.9830999970436096,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9775999784469604,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9613999724388123,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7435673475265503},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.7312878370285034},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.6240720748901367},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.6183632612228394},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.5834845304489136},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.5555520057678223},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5539238452911377},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.4637245535850525},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.4581119418144226},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.4379596710205078},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.423373281955719},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4114547073841095},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.29657983779907227},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.11163389682769775},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.11011171340942383}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7435673475265503},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.7312878370285034},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.6240720748901367},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.6183632612228394},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.5834845304489136},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.5555520057678223},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5539238452911377},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.4637245535850525},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4581119418144226},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.4379596710205078},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.423373281955719},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4114547073841095},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.29657983779907227},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.11163389682769775},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.11011171340942383}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01580604","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01580604","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","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":10,"referenced_works":["https://openalex.org/W835219510","https://openalex.org/W1968907718","https://openalex.org/W1979286451","https://openalex.org/W1990337640","https://openalex.org/W2002531683","https://openalex.org/W2029479369","https://openalex.org/W2089016801","https://openalex.org/W2154501376","https://openalex.org/W2338905098","https://openalex.org/W4213060883"],"related_works":["https://openalex.org/W3035974271","https://openalex.org/W3141113327","https://openalex.org/W2080904092","https://openalex.org/W3161514703","https://openalex.org/W2098682899","https://openalex.org/W4206915070","https://openalex.org/W1994440468","https://openalex.org/W2051329268","https://openalex.org/W2531764854","https://openalex.org/W2625547693"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}