{"id":"https://openalex.org/W2048926244","doi":"https://doi.org/10.1007/bf02614366","title":"A new strongly polynomial dual network simplex algorithm","display_name":"A new strongly polynomial dual network simplex algorithm","publication_year":1997,"publication_date":"1997-08-01","ids":{"openalex":"https://openalex.org/W2048926244","doi":"https://doi.org/10.1007/bf02614366","mag":"2048926244"},"language":"en","primary_location":{"id":"doi:10.1007/bf02614366","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02614366","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/A5076048717","display_name":"Ronald D. Armstrong","orcid":"https://orcid.org/0000-0001-6991-4730"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]},{"id":"https://openalex.org/I172901346","display_name":"St Petersburg University","ror":"https://ror.org/023znxa73","country_code":"RU","type":"education","lineage":["https://openalex.org/I172901346"]}],"countries":["RU","US"],"is_corresponding":true,"raw_author_name":"Ronald D. Armstrong","raw_affiliation_strings":["Graduate School of Management and RUTCOR \u2014 Rutgers Center for Operations Research, Rutgers University, 07102, Newark, NJ, USA","Graduate School of Management and RUTCOR \u2014 Rutgers Center for Operations Research, Rutgers University, Newark, USA"],"affiliations":[{"raw_affiliation_string":"Graduate School of Management and RUTCOR \u2014 Rutgers Center for Operations Research, Rutgers University, 07102, Newark, NJ, USA","institution_ids":["https://openalex.org/I102322142"]},{"raw_affiliation_string":"Graduate School of Management and RUTCOR \u2014 Rutgers Center for Operations Research, Rutgers University, Newark, USA","institution_ids":["https://openalex.org/I172901346"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074795292","display_name":"Zhiying Jin","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]},{"id":"https://openalex.org/I172901346","display_name":"St Petersburg University","ror":"https://ror.org/023znxa73","country_code":"RU","type":"education","lineage":["https://openalex.org/I172901346"]}],"countries":["RU","US"],"is_corresponding":false,"raw_author_name":"Zhiying Jin","raw_affiliation_strings":["Graduate School of Management and RUTCOR \u2014 Rutgers Center for Operations Research, Rutgers University, 07102, Newark, NJ, USA","Graduate School of Management and RUTCOR \u2014 Rutgers Center for Operations Research, Rutgers University, Newark, USA"],"affiliations":[{"raw_affiliation_string":"Graduate School of Management and RUTCOR \u2014 Rutgers Center for Operations Research, Rutgers University, 07102, Newark, NJ, USA","institution_ids":["https://openalex.org/I102322142"]},{"raw_affiliation_string":"Graduate School of Management and RUTCOR \u2014 Rutgers Center for Operations Research, Rutgers University, Newark, USA","institution_ids":["https://openalex.org/I172901346"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5076048717"],"corresponding_institution_ids":["https://openalex.org/I102322142","https://openalex.org/I172901346"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":2.0644,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.8670536,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"78","issue":"2","first_page":"131","last_page":"148"},"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.9991999864578247,"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.9991999864578247,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9988999962806702,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9980999827384949,"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/simplex","display_name":"Simplex","score":0.7482885122299194},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.7125321626663208},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6306920051574707},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.6013567447662354},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5922778844833374},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.5845843553543091},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5691914558410645},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.51129150390625},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.4894527494907379},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.48298871517181396},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.45098409056663513},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.42908498644828796},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3854711353778839},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.37385594844818115}],"concepts":[{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.7482885122299194},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.7125321626663208},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6306920051574707},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.6013567447662354},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5922778844833374},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.5845843553543091},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5691914558410645},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.51129150390625},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.4894527494907379},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48298871517181396},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.45098409056663513},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.42908498644828796},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3854711353778839},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.37385594844818115},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"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/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/bf02614366","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02614366","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"},{"id":"pmh:oai:ddd.uab.cat:111","is_oa":false,"landing_page_url":"https://ddd.uab.cat/record/111","pdf_url":null,"source":{"id":"https://openalex.org/S4306400380","display_name":"Dip\u00f2sit Digital de Documents de la UAB (Universitat Aut\u00f2noma de Barcelona)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I123044942","host_organization_name":"Universitat Aut\u00f2noma de Barcelona","host_organization_lineage":["https://openalex.org/I123044942"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1977545325","https://openalex.org/W1989124349","https://openalex.org/W2002470337","https://openalex.org/W2047029951","https://openalex.org/W2056178482","https://openalex.org/W2061330415","https://openalex.org/W2062308245","https://openalex.org/W2092845620","https://openalex.org/W2149342630","https://openalex.org/W2150154671","https://openalex.org/W2156036190","https://openalex.org/W4246468160","https://openalex.org/W4294576787"],"related_works":["https://openalex.org/W2751864552","https://openalex.org/W2147965279","https://openalex.org/W1846390803","https://openalex.org/W2187985096","https://openalex.org/W1985873373","https://openalex.org/W2043901793","https://openalex.org/W2169627377","https://openalex.org/W3139172074","https://openalex.org/W1966645385","https://openalex.org/W2074575703"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}