{"id":"https://openalex.org/W2009777378","doi":"https://doi.org/10.1142/s1793830910000735","title":"MINIMUM FLOW VARIATION IN MAXIMUM FLOWS","display_name":"MINIMUM FLOW VARIATION IN MAXIMUM FLOWS","publication_year":2010,"publication_date":"2010-09-01","ids":{"openalex":"https://openalex.org/W2009777378","doi":"https://doi.org/10.1142/s1793830910000735","mag":"2009777378"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830910000735","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830910000735","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","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/A5078302855","display_name":"Mahan Masoumi","orcid":null},"institutions":[{"id":"https://openalex.org/I155419210","display_name":"Islamic Azad University, Science and Research Branch","ror":"https://ror.org/03187yj51","country_code":"IR","type":"education","lineage":["https://openalex.org/I110525433","https://openalex.org/I155419210"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"M. MASOUMI","raw_affiliation_strings":["Department of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iran","institution_ids":["https://openalex.org/I155419210"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068192296","display_name":"A. M. MOBASSERI","orcid":null},"institutions":[{"id":"https://openalex.org/I155419210","display_name":"Islamic Azad University, Science and Research Branch","ror":"https://ror.org/03187yj51","country_code":"IR","type":"education","lineage":["https://openalex.org/I110525433","https://openalex.org/I155419210"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"A. M. MOBASSERI","raw_affiliation_strings":["Department of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iran","institution_ids":["https://openalex.org/I155419210"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018744806","display_name":"Alireza Rezaei","orcid":"https://orcid.org/0000-0002-8937-8442"},"institutions":[{"id":"https://openalex.org/I48379061","display_name":"Shahid Beheshti University","ror":"https://ror.org/0091vmj44","country_code":"IR","type":"education","lineage":["https://openalex.org/I48379061"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"A. R. REZAEI","raw_affiliation_strings":["Department of Computer Sciences, Shahid Beheshti University, G.C., Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, Shahid Beheshti University, G.C., Tehran, Iran","institution_ids":["https://openalex.org/I48379061"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08898973,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"02","issue":"03","first_page":"389","last_page":"393"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12238","display_name":"Green IT and Sustainability","score":0.98089998960495,"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/T12238","display_name":"Green IT and Sustainability","score":0.98089998960495,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.972599983215332,"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/T11053","display_name":"Process Optimization and Integration","score":0.9412999749183655,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/flow-network","display_name":"Flow network","score":0.6480146646499634},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.5778104066848755},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.5353155136108398},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.50975102186203},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.48226624727249146},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4518931210041046},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.4447943866252899},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35729748010635376},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.12211734056472778}],"concepts":[{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.6480146646499634},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.5778104066848755},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5353155136108398},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.50975102186203},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.48226624727249146},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4518931210041046},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.4447943866252899},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35729748010635376},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.12211734056472778}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830910000735","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830910000735","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","score":0.5299999713897705,"id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1548164611","https://openalex.org/W2093882311","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W4210766026","https://openalex.org/W4213060235","https://openalex.org/W4213060883","https://openalex.org/W4245965070"],"related_works":["https://openalex.org/W3161514703","https://openalex.org/W3035974271","https://openalex.org/W3141113327","https://openalex.org/W2098682899","https://openalex.org/W4206915070","https://openalex.org/W2080904092","https://openalex.org/W2531764854","https://openalex.org/W2051329268","https://openalex.org/W1994440468","https://openalex.org/W4311255633"],"abstract_inverted_index":{"Network":[0],"flows":[1],"are":[2,52],"of":[3,32,75,84,97,106,111,121],"growing":[4],"interest":[5],"in":[6,49,67,77,86,91,100,108],"both":[7],"applications":[8,105],"and":[9,17],"theory.":[10],"Given":[11],"a":[12,29,118,137],"network":[13],"flow":[14,33,58,135],"with":[15],"costs":[16],"arc":[18,63,66],"capacities,":[19],"the":[20,35,39,46,57,68,73,82,95,101,109,122,132],"classical":[21],"max":[22,123,134],"flow-min":[23,124],"cost":[24,96,125],"problem":[25],"is":[26,59,129],"to":[27,38,64,93,130],"send":[28],"given":[30,138],"amount":[31],"from":[34],"source":[36],"vertex":[37,41],"sink":[40],"at":[42],"least":[43],"cost.":[44],"Among":[45],"predominant":[47],"issues":[48],"this":[50],"field":[51],"problems":[53],"that":[54],"result":[55],"when":[56],"going":[60],"through":[61],"one":[62],"another":[65],"same":[69],"direction,":[70],"such":[71],"as":[72],"role":[74,83],"compressors":[76],"gas":[78],"pipeline":[79],"networks":[80],"or":[81],"transformers":[85],"electricity":[87],"wide":[88],"networks.":[89],"Hence,":[90],"order":[92],"minimize":[94],"these":[98],"elements":[99],"network,":[102],"we":[103],"perform":[104],"line-digraphs":[107],"form":[110],"an":[112],"optimization":[113],"algorithm.":[114],"This":[115],"paper":[116],"proposes":[117],"new":[119],"variant":[120],"problem.":[126],"Our":[127],"objective":[128],"find":[131],"smoothest":[133],"over":[136],"network.":[139]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}