{"id":"https://openalex.org/W2169278451","doi":"https://doi.org/10.1007/s00453-004-1085-2","title":"A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem","display_name":"A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem","publication_year":2004,"publication_date":"2004-02-25","ids":{"openalex":"https://openalex.org/W2169278451","doi":"https://doi.org/10.1007/s00453-004-1085-2","mag":"2169278451"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-004-1085-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-004-1085-2","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","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":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ravindra K. Ahuja","raw_affiliation_strings":["Industrial & Systems Engineering,\n University of Florida,\nGainesville, FL 32611, USA"],"affiliations":[{"raw_affiliation_string":"Industrial & Systems Engineering,\n University of Florida,\nGainesville, FL 32611, USA","institution_ids":["https://openalex.org/I33213144"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085640376","display_name":"Dorit S. Hochbaum","orcid":"https://orcid.org/0000-0002-2498-0512"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Dorit S. Hochbaum","raw_affiliation_strings":["Industrial Engineering & Operations Research and Walter A. Haas School of Business, University of California,\nBerkeley, CA 94720, USA"],"affiliations":[{"raw_affiliation_string":"Industrial Engineering & Operations Research and Walter A. Haas School of Business, University of California,\nBerkeley, CA 94720, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072685560","display_name":"James B. Orlin","orcid":"https://orcid.org/0000-0002-7488-094X"},"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":true,"raw_author_name":"James B. Orlin","raw_affiliation_strings":["Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA 02139, USA"],"affiliations":[{"raw_affiliation_string":"Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA 02139, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5072685560","https://openalex.org/A5085640376","https://openalex.org/A5106764134"],"corresponding_institution_ids":["https://openalex.org/I33213144","https://openalex.org/I63966007","https://openalex.org/I95457486"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":18.0511,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":{"value":0.98946478,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"39","issue":"3","first_page":"189","last_page":"208"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9850999712944031,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"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/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9850999712944031,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9829999804496765,"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/T11606","display_name":"Infrastructure Maintenance and Monitoring","score":0.9707000255584717,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural 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/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.7916769981384277},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.7153416275978088},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6825516223907471},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.6028317809104919},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.5442355871200562},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.5270410180091858},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.501746654510498},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.4895411431789398},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4721142053604126},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.44695979356765747},{"id":"https://openalex.org/keywords/cut","display_name":"Cut","score":0.4430040419101715},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4302121102809906},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.4293716549873352},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4202735722064972},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.41167110204696655},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3796146512031555},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3499092757701874},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3130127787590027},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24967175722122192},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15852731466293335}],"concepts":[{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.7916769981384277},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.7153416275978088},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6825516223907471},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.6028317809104919},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5442355871200562},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.5270410180091858},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.501746654510498},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.4895411431789398},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4721142053604126},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.44695979356765747},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.4430040419101715},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4302121102809906},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.4293716549873352},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4202735722064972},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.41167110204696655},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3796146512031555},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3499092757701874},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3130127787590027},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24967175722122192},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15852731466293335},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C89600930","wikidata":"https://www.wikidata.org/wiki/Q1423946","display_name":"Segmentation","level":2,"score":0.0},{"id":"https://openalex.org/C124504099","wikidata":"https://www.wikidata.org/wiki/Q56933","display_name":"Image segmentation","level":3,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00453-004-1085-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-004-1085-2","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.297.5728","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.5728","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://jorlin.scripts.mit.edu/docs/publications/81-Cut based dual flows.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1977545325","https://openalex.org/W2000472767","https://openalex.org/W2005058686","https://openalex.org/W2007619042","https://openalex.org/W2013347084","https://openalex.org/W2020282424","https://openalex.org/W2037823059","https://openalex.org/W2046715803","https://openalex.org/W2053352956","https://openalex.org/W2061872629","https://openalex.org/W2080375462","https://openalex.org/W2090359754","https://openalex.org/W2093128520","https://openalex.org/W2099463627","https://openalex.org/W2104452301","https://openalex.org/W2127470768","https://openalex.org/W2128208761","https://openalex.org/W2145532166"],"related_works":["https://openalex.org/W2080904092","https://openalex.org/W2942946217","https://openalex.org/W2129497110","https://openalex.org/W2186707160","https://openalex.org/W2141353198","https://openalex.org/W1974018476","https://openalex.org/W2590727506","https://openalex.org/W2169278451","https://openalex.org/W2377700283","https://openalex.org/W2912098148"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"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"}