{"id":"https://openalex.org/W11928021","doi":"https://doi.org/10.1007/978-0-387-30165-5_6","title":"Minimum Cost Network Flow Algorithms","display_name":"Minimum Cost Network Flow Algorithms","alternate_titles":[],"publication_year":2008,"publication_date":"2008-12-09","ids":{"openalex":"https://openalex.org/W11928021","doi":"https://doi.org/10.1007/978-0-387-30165-5_6","mag":"11928021"},"language":"en","primary_location":{"id":"doi:10.1007/978-0-387-30165-5_6","doi":"https://doi.org/10.1007/978-0-387-30165-5_6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-0-387-30165-5_6","pdf_url":null,"source":{"id":"https://openalex.org/S4306463937","display_name":"Springer eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Handbook of Optimization in Telecommunications","raw_type":"book-chapter"},"parent_works":[{"id":"https://openalex.org/W625072069","display_name":"Handbook of Optimization in Telecommunications","relationship":"volume"}],"lineage":["https://openalex.org/W11928021","https://openalex.org/W625072069"],"child_works_count":0,"type":"book-chapter","is_traditional":true,"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/A5109112660","display_name":"Jeffery L. Kennington","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I178169726","display_name":"Southern Methodist University","ror":"https://ror.org/042tdr378","country_code":"US","type":"education","lineage":["https://openalex.org/I178169726"]}],"countries":["US"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Jeffery L. Kennington","raw_affiliation_strings":["Southern Methodist University, Dallas, Texas, 75275, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Southern Methodist University, Dallas, Texas, 75275, USA","institution_ids":["https://openalex.org/I178169726"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064104809","display_name":"Richard V. Helgason","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I178169726","display_name":"Southern Methodist University","ror":"https://ror.org/042tdr378","country_code":"US","type":"education","lineage":["https://openalex.org/I178169726"]}],"countries":["US"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Richard V. Helgason","raw_affiliation_strings":["Southern Methodist University, Dallas, Texas, 75275, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Southern Methodist University, Dallas, Texas, 75275, USA","institution_ids":["https://openalex.org/I178169726"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I178169726"],"apc_list":null,"apc_paid":null,"fwci":0.9243,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.74439919,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"147","last_page":"162"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994999766349792,"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.9994999766349792,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.0003000000142492354,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.00019999999494757503,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/minimum-cost-flow","display_name":"minimum cost flow","score":0.8949999809265137},{"id":"https://openalex.org/keywords/network-simplex-method","display_name":"network simplex method","score":0.878000020980835},{"id":"https://openalex.org/keywords/optimality-conditions","display_name":"optimality conditions","score":0.7200000286102295},{"id":"https://openalex.org/keywords/tree-data-structures","display_name":"tree data structures","score":0.6129999756813049},{"id":"https://openalex.org/keywords/linear-programming-algorithms","display_name":"linear programming algorithms","score":0.6510000228881836},{"id":"https://openalex.org/keywords/network-optimization","display_name":"network optimization","score":0.515999972820282}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.696041464805603},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.683168888092041},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.6828548908233643},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.6451421976089478},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.60678631067276},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5977151989936829},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5775137543678284},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.5109726190567017},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5055742263793945},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.4791554808616638},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4426960349082947},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31430351734161377},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-0-387-30165-5_6","doi":"https://doi.org/10.1007/978-0-387-30165-5_6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-0-387-30165-5_6","pdf_url":null,"source":{"id":"https://openalex.org/S4306463937","display_name":"Springer eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Handbook of Optimization in Telecommunications","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W190196663","https://openalex.org/W306123262","https://openalex.org/W1537221987","https://openalex.org/W1545925697","https://openalex.org/W1561880747","https://openalex.org/W1567487011","https://openalex.org/W1594308867","https://openalex.org/W1964119857","https://openalex.org/W1977545325","https://openalex.org/W1997116158","https://openalex.org/W1997373408","https://openalex.org/W2031763823","https://openalex.org/W2037209059","https://openalex.org/W2037823059","https://openalex.org/W2044973895","https://openalex.org/W2066375037","https://openalex.org/W2127470768","https://openalex.org/W2150154671","https://openalex.org/W2158550687","https://openalex.org/W2159046795","https://openalex.org/W2182811131","https://openalex.org/W2269695513","https://openalex.org/W2322316662","https://openalex.org/W2407734796","https://openalex.org/W2500747461","https://openalex.org/W2609152907","https://openalex.org/W3113130260","https://openalex.org/W4230397637","https://openalex.org/W4247927012","https://openalex.org/W4248313157","https://openalex.org/W4300533730","https://openalex.org/W4301216918","https://openalex.org/W6781618339"],"related_works":["https://openalex.org/W1983853123","https://openalex.org/W7099734494","https://openalex.org/W2013479277","https://openalex.org/W2000247330","https://openalex.org/W2185065513","https://openalex.org/W1976349582","https://openalex.org/W2092572272","https://openalex.org/W2022168599","https://openalex.org/W4285174960","https://openalex.org/W7101029263"],"abstract_inverted_index":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W11928021","counts_by_year":[],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2016-06-24T00:00:00"}
