{"id":"https://openalex.org/W1974548385","doi":"https://doi.org/10.1007/s001860200202","title":"On dual minimum cost flow algorithms","display_name":"On dual minimum cost flow algorithms","publication_year":2002,"publication_date":"2002-08-01","ids":{"openalex":"https://openalex.org/W1974548385","doi":"https://doi.org/10.1007/s001860200202","mag":"1974548385"},"language":"en","primary_location":{"id":"doi:10.1007/s001860200202","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s001860200202","pdf_url":null,"source":{"id":"https://openalex.org/S126160977","display_name":"Mathematical Methods of Operations Research","issn_l":"1432-2994","issn":["1432-2994","1432-5217"],"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 Methods of Operations Research (ZOR)","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/A5028076811","display_name":"Jens Vygen","orcid":null},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Jens Vygen","raw_affiliation_strings":["Research Institute for Discrete Mathematics, University of Bonn, Lenn\u00e9str. 2, 53113 Bonn, Germany (e-mail: vygen@or.uni-bonn.de), , , , , , DE","Research Institute for Discrete Mathematics, University of Bonn, Lenn\u00e9str. 2, 53113 Bonn, Germany (e-mail: vygen@or.uni-bonn.de), DE"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research Institute for Discrete Mathematics, University of Bonn, Lenn\u00e9str. 2, 53113 Bonn, Germany (e-mail: vygen@or.uni-bonn.de), , , , , , DE","institution_ids":["https://openalex.org/I135140700"]},{"raw_affiliation_string":"Research Institute for Discrete Mathematics, University of Bonn, Lenn\u00e9str. 2, 53113 Bonn, Germany (e-mail: vygen@or.uni-bonn.de), DE","institution_ids":["https://openalex.org/I135140700"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5028076811"],"corresponding_institution_ids":["https://openalex.org/I135140700"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":2.3444,"has_fulltext":false,"cited_by_count":46,"citation_normalized_percentile":{"value":0.87403898,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"56","issue":"1","first_page":"101","last_page":"126"},"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.9998999834060669,"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.9998999834060669,"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.9987000226974487,"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.9864000082015991,"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/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.8111073970794678},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7008318305015564},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.6547446846961975},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.5857418179512024},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.5644574761390686},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.5386947989463806},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5154203176498413},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.514067530632019},{"id":"https://openalex.org/keywords/out-of-kilter-algorithm","display_name":"Out-of-kilter algorithm","score":0.43698757886886597},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39473310112953186},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.3702930212020874},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3391048312187195},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2667754888534546},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1242409348487854},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.10243639349937439},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.0740179717540741}],"concepts":[{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.8111073970794678},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7008318305015564},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.6547446846961975},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.5857418179512024},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.5644574761390686},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5386947989463806},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5154203176498413},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.514067530632019},{"id":"https://openalex.org/C133824558","wikidata":"https://www.wikidata.org/wiki/Q16893660","display_name":"Out-of-kilter algorithm","level":5,"score":0.43698757886886597},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39473310112953186},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3702930212020874},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3391048312187195},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2667754888534546},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1242409348487854},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.10243639349937439},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.0740179717540741}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s001860200202","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s001860200202","pdf_url":null,"source":{"id":"https://openalex.org/S126160977","display_name":"Mathematical Methods of Operations Research","issn_l":"1432-2994","issn":["1432-2994","1432-5217"],"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 Methods of Operations Research (ZOR)","raw_type":"journal-article"},{"id":"pmh:hdl:10068/115715","is_oa":false,"landing_page_url":"http://hdl.handle.net/10068/115715","pdf_url":null,"source":{"id":"https://openalex.org/S4377196900","display_name":"OpenGrey (Institut de l'Information Scientifique et Technique)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1295345811","host_organization_name":"Institut de l'Information Scientifique et Technique","host_organization_lineage":["https://openalex.org/I1295345811"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"R - Report"},{"id":"pmh:oai:RePEc:spr:compst:v:56:y:2002:i:1:p:101-126","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1007/s001860200202","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W86044744","https://openalex.org/W1537272759","https://openalex.org/W1963547452","https://openalex.org/W1964119857","https://openalex.org/W1964540128","https://openalex.org/W1975387839","https://openalex.org/W1992170089","https://openalex.org/W2000830753","https://openalex.org/W2002470337","https://openalex.org/W2003713856","https://openalex.org/W2006228567","https://openalex.org/W2020165787","https://openalex.org/W2048926244","https://openalex.org/W2060088365","https://openalex.org/W2075322358","https://openalex.org/W2099463627","https://openalex.org/W2139559590","https://openalex.org/W2150154671","https://openalex.org/W2156036190","https://openalex.org/W2169528473","https://openalex.org/W2169825170","https://openalex.org/W2227557434","https://openalex.org/W2338905098","https://openalex.org/W2998757566","https://openalex.org/W3138807513"],"related_works":["https://openalex.org/W2098682899","https://openalex.org/W2625547693","https://openalex.org/W4206915070","https://openalex.org/W3006069386","https://openalex.org/W2355612523","https://openalex.org/W2590727506","https://openalex.org/W2080904092","https://openalex.org/W3141113327","https://openalex.org/W2149301478","https://openalex.org/W3159013657"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-08-08T01:25:22.217667","created_date":"2025-10-10T00:00:00"}