{"id":"https://openalex.org/W2149441175","doi":"https://doi.org/10.5430/air.v2n1p81","title":"The dual network theorem for static flow networks and its application for maximising the throughput flow","display_name":"The dual network theorem for static flow networks and its application for maximising the throughput flow","publication_year":2012,"publication_date":"2012-11-20","ids":{"openalex":"https://openalex.org/W2149441175","doi":"https://doi.org/10.5430/air.v2n1p81","mag":"2149441175"},"language":"en","primary_location":{"id":"doi:10.5430/air.v2n1p81","is_oa":true,"landing_page_url":"https://doi.org/10.5430/air.v2n1p81","pdf_url":"https://www.sciedu.ca/journal/index.php/air/article/download/1447/1181","source":{"id":"https://openalex.org/S4210167461","display_name":"Artificial Intelligence Research","issn_l":"1927-6974","issn":["1927-6974","1927-6982"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320842","host_organization_name":"Sciedu Press","host_organization_lineage":["https://openalex.org/P4310320842"],"host_organization_lineage_names":["Sciedu Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Artificial Intelligence Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.sciedu.ca/journal/index.php/air/article/download/1447/1181","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038488944","display_name":"Michael Todinov","orcid":"https://orcid.org/0000-0002-3957-7961"},"institutions":[{"id":"https://openalex.org/I124261462","display_name":"Oxford Brookes University","ror":"https://ror.org/04v2twj65","country_code":"GB","type":"education","lineage":["https://openalex.org/I124261462"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Michael Todorov Todinov","raw_affiliation_strings":["Oxford Brookes University\r\nDepartment of Mechanical Engineering\r\nand Mathematical Sciences"],"affiliations":[{"raw_affiliation_string":"Oxford Brookes University\r\nDepartment of Mechanical Engineering\r\nand Mathematical Sciences","institution_ids":["https://openalex.org/I124261462"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5038488944"],"corresponding_institution_ids":["https://openalex.org/I124261462"],"apc_list":null,"apc_paid":null,"fwci":1.0366,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.78903346,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"2","issue":"1","first_page":null,"last_page":null},"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.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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9983999729156494,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9966999888420105,"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/throughput","display_name":"Throughput","score":0.8229824304580688},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.6713489294052124},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.6490306854248047},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.6455538272857666},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.624509334564209},{"id":"https://openalex.org/keywords/maximum-throughput-scheduling","display_name":"Maximum throughput scheduling","score":0.623050332069397},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.5474099516868591},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.4518798887729645},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.4268742501735687},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.34869280457496643},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.334098756313324},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.28399503231048584},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.24424681067466736},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24114370346069336}],"concepts":[{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.8229824304580688},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.6713489294052124},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.6490306854248047},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.6455538272857666},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.624509334564209},{"id":"https://openalex.org/C29722447","wikidata":"https://www.wikidata.org/wiki/Q17097321","display_name":"Maximum throughput scheduling","level":5,"score":0.623050332069397},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.5474099516868591},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.4518798887729645},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.4268742501735687},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.34869280457496643},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.334098756313324},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.28399503231048584},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.24424681067466736},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24114370346069336},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.0},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"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/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","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},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.0},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.5430/air.v2n1p81","is_oa":true,"landing_page_url":"https://doi.org/10.5430/air.v2n1p81","pdf_url":"https://www.sciedu.ca/journal/index.php/air/article/download/1447/1181","source":{"id":"https://openalex.org/S4210167461","display_name":"Artificial Intelligence Research","issn_l":"1927-6974","issn":["1927-6974","1927-6982"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320842","host_organization_name":"Sciedu Press","host_organization_lineage":["https://openalex.org/P4310320842"],"host_organization_lineage_names":["Sciedu Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Artificial Intelligence Research","raw_type":"journal-article"},{"id":"pmh:tle:29ab179f-4e98-49bb-989e-b4288a0dc703:b4ef9587-4603-18f8-a471-bb20511f0ad9:1","is_oa":true,"landing_page_url":"https://radar.brookes.ac.uk/radar/items/29ab179f-4e98-49bb-989e-b4288a0dc703/1","pdf_url":"https://radar.brookes.ac.uk/radar/file/29ab179f-4e98-49bb-989e-b4288a0dc703/1/todinov2013dual.pdf","source":{"id":"https://openalex.org/S4306400541","display_name":"Radar (Oxford Brookes University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124261462","host_organization_name":"Oxford Brookes University","host_organization_lineage":["https://openalex.org/I124261462"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Artificial Intelligence Research","raw_type":"article"}],"best_oa_location":{"id":"doi:10.5430/air.v2n1p81","is_oa":true,"landing_page_url":"https://doi.org/10.5430/air.v2n1p81","pdf_url":"https://www.sciedu.ca/journal/index.php/air/article/download/1447/1181","source":{"id":"https://openalex.org/S4210167461","display_name":"Artificial Intelligence Research","issn_l":"1927-6974","issn":["1927-6974","1927-6982"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320842","host_organization_name":"Sciedu Press","host_organization_lineage":["https://openalex.org/P4310320842"],"host_organization_lineage_names":["Sciedu Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Artificial Intelligence Research","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.5600000023841858,"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7"}],"awards":[{"id":"https://openalex.org/G7522173050","display_name":null,"funder_award_id":"F/00 382/J","funder_id":"https://openalex.org/F4320319993","funder_display_name":"Leverhulme Trust"}],"funders":[{"id":"https://openalex.org/F4320319993","display_name":"Leverhulme Trust","ror":"https://ror.org/012mzw131"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2149441175.pdf","grobid_xml":"https://content.openalex.org/works/W2149441175.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W412793603","https://openalex.org/W1513400187","https://openalex.org/W1551635709","https://openalex.org/W1977545325","https://openalex.org/W2002531683","https://openalex.org/W2009710482","https://openalex.org/W2039086323","https://openalex.org/W2069454646","https://openalex.org/W2090359754","https://openalex.org/W2108800124","https://openalex.org/W2111822775","https://openalex.org/W2114264031","https://openalex.org/W2130762611","https://openalex.org/W2147965279","https://openalex.org/W2149342630","https://openalex.org/W2154430520","https://openalex.org/W2154501376","https://openalex.org/W2340006107","https://openalex.org/W2502700164","https://openalex.org/W2752885492","https://openalex.org/W3145128584","https://openalex.org/W4213060883","https://openalex.org/W4230267811","https://openalex.org/W4299409673","https://openalex.org/W6676809105","https://openalex.org/W6992951189","https://openalex.org/W7029321148"],"related_works":["https://openalex.org/W3035974271","https://openalex.org/W3141113327","https://openalex.org/W2080904092","https://openalex.org/W3161514703","https://openalex.org/W4206915070","https://openalex.org/W1994440468","https://openalex.org/W2051329268","https://openalex.org/W1970952976","https://openalex.org/W2531764854","https://openalex.org/W3000598246"],"abstract_inverted_index":{"The":[0,23],"paper":[1,167],"discuses":[2],"a":[3,73,84,101,111,121,130,173],"new":[4,122],"fundamental":[5,174],"result":[6],"in":[7,31,63,72,93,110,117,129,141,176,207,227,244],"the":[8,16,27,38,43,48,51,60,64,77,80,90,94,107,115,126,142,146,153,162,181,190,199,208,228],"theory":[9],"of":[10,42,47,100,151,172,192,205,218,225,242],"flow":[11,21,30,54,62,74,92,109,128,149,183,197,206,213,243],"networks":[12,136,185],"referred":[13],"to":[14,37],"as":[15],"\u2018dual":[17],"network":[18,34,82,131],"theorem":[19,24],"forstatic":[20],"networks\u2019.":[22],"states":[25],"that":[26],"maximum":[28,147,163],"throughput":[29,78,91,108,127,148,164,182],"any":[32,157],"static":[33,196],"is":[35,83,150,233],"equal":[36],"sum":[39],"ofthe":[40],"capacities":[41],"edges":[44],"coming":[45],"out":[46],"source,":[49],"minus":[50],"total":[52],"excess":[53,57],"at":[55],"all":[56],"nodes,":[58,140],"plus":[59],"maximumthroughput":[61],"dual":[65,81,119],"network.":[66,96],"For":[67,135],"very":[68,102],"few":[69,138],"imbalanced":[70,139],"nodes":[71],"network,":[75,112],"determining":[76,89,161],"flowin":[79],"task":[85],"significantly":[86],"easier":[87],"than":[88],"original":[95],"This":[97],"createsthe":[98],"basis":[99],"efficient":[103],"algorithm":[104,123],"for":[105,124,160,179,236],"maximising":[106,114,125,180],"by":[113],"throughputflow":[116],"its":[118],"network.Consequently,":[120],"has":[132],"been":[133],"proposed.":[134],"withvery":[137],"case":[143],"where":[144],"only":[145],"interest,":[152],"proposed":[154,235],"algorithmwill":[155],"outperform":[156],"classical":[158,177],"method":[159],"flow.In":[165],"this":[166],"we":[168],"also":[169,234],"raise":[170],"awareness":[171],"flaw":[175],"algorithms":[178],"instatic":[184],"with":[186],"directed":[187,203,212,240],"edges.":[188],"Despite":[189],"years":[191],"intensive":[193],"research":[194],"on":[195],"networks,":[198],"classicalalgorithms":[200],"leave":[201],"undesirable":[202],"loops":[204,214,241],"optimised":[209,229],"networks.":[210,230,245],"These":[211],"are":[215],"associatedwith":[216],"wastage":[217],"energy":[219],"and":[220,222,238],"resources":[221],"increased":[223],"levels":[224],"congestion":[226],"Consequently,":[231],"analgorithm":[232],"discovering":[237],"removing":[239]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}