{"id":"https://openalex.org/W2111822775","doi":"https://doi.org/10.1109/tr.2011.2104453","title":"Analysis and Optimization of Repairable Flow Networks With Complex Topology","display_name":"Analysis and Optimization of Repairable Flow Networks With Complex Topology","publication_year":2011,"publication_date":"2011-01-28","ids":{"openalex":"https://openalex.org/W2111822775","doi":"https://doi.org/10.1109/tr.2011.2104453","mag":"2111822775"},"language":"en","primary_location":{"id":"doi:10.1109/tr.2011.2104453","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tr.2011.2104453","pdf_url":null,"source":{"id":"https://openalex.org/S87725633","display_name":"IEEE Transactions on Reliability","issn_l":"0018-9529","issn":["0018-9529","1558-1721"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Reliability","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/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 T. Todinov","raw_affiliation_strings":["Department of Mechanical Engineering and Mathematical Sciences School of Technology, Oxford Brookes University, Oxford, UK","Department of Mechanical Engineering and Mathematical Sciences School of Technology, Oxford Brookes University Wheatley, Oxford, U.K"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering and Mathematical Sciences School of Technology, Oxford Brookes University, Oxford, UK","institution_ids":["https://openalex.org/I124261462"]},{"raw_affiliation_string":"Department of Mechanical Engineering and Mathematical Sciences School of Technology, Oxford Brookes University Wheatley, Oxford, U.K","institution_ids":[]}]}],"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":9.8228,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.97530917,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"60","issue":"1","first_page":"111","last_page":"124"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9976999759674072,"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.9976999759674072,"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/T12423","display_name":"Software Reliability and Analysis Research","score":0.9523000121116638,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T11357","display_name":"Risk and Safety Analysis","score":0.9060999751091003,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.6923393607139587},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.6229574084281921},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.5825086832046509},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.5370378494262695},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5314478278160095},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5106413960456848},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.44054847955703735},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.4224448502063751},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36399146914482117},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34913522005081177},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09900262951850891},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.07399299740791321}],"concepts":[{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.6923393607139587},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.6229574084281921},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.5825086832046509},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.5370378494262695},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5314478278160095},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5106413960456848},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.44054847955703735},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.4224448502063751},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36399146914482117},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34913522005081177},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09900262951850891},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.07399299740791321},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tr.2011.2104453","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tr.2011.2104453","pdf_url":null,"source":{"id":"https://openalex.org/S87725633","display_name":"IEEE Transactions on Reliability","issn_l":"0018-9529","issn":["0018-9529","1558-1721"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Reliability","raw_type":"journal-article"}],"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/W73629738","https://openalex.org/W571557750","https://openalex.org/W1973651353","https://openalex.org/W1977545325","https://openalex.org/W1992580876","https://openalex.org/W2002531683","https://openalex.org/W2021042173","https://openalex.org/W2045129218","https://openalex.org/W2061170302","https://openalex.org/W2090359754","https://openalex.org/W2129170611","https://openalex.org/W2149342630","https://openalex.org/W2154501376","https://openalex.org/W2217929805","https://openalex.org/W2752573522","https://openalex.org/W3014094413","https://openalex.org/W4213060235","https://openalex.org/W4213060883"],"related_works":["https://openalex.org/W2375873432","https://openalex.org/W4206915070","https://openalex.org/W2531764854","https://openalex.org/W2098682899","https://openalex.org/W3161514703","https://openalex.org/W2141299097","https://openalex.org/W1851375266","https://openalex.org/W2610002854","https://openalex.org/W3141113327","https://openalex.org/W4206407367"],"abstract_inverted_index":{"We":[0,182],"propose":[1,377],"a":[2,31,50,66,95,120,132,147,175,186,200,317,323,378,388,395,408,420],"framework":[3],"for":[4,25,34,52,59,68,80,146,168,269,331,341,369,382,398],"analysis":[5],"and":[6,15,75,180,184,244,296,309,346,410],"optimization":[7,70,380,403],"of":[8,38,71,131,141,422],"repairable":[9,43,60,72,110,125,191,201,271,426],"flow":[10,19,21,41,44,56,73,83,86,93,97,105,126,133,148,172,192,198,202,214,233,251,261,272,287,303,321,335,343,355,391],"networks":[11,26,45,61,74,87,193,273,427],"by":[12,210,223,246,351],"(i)":[13],"stating":[14],"proving":[16],"the":[17,36,39,54,82,92,104,107,138,151,154,217,220,224,232,236,248,254,286,290,302,313,333,348,352,366,384,400,416,424,430],"maximum":[18,389],"minimum":[20],"path":[22,149,234,252],"resistance":[23,130],"theorem":[24,188],"with":[27,46,62,88,177,194,204,231,235,253,274,414],"merging":[28,89,195,205],"flows":[29,206],"(ii)":[30],"discrete-event":[32,267,283,314],"solver":[33,268,284,315],"determining":[35,53,169,332,383],"variation":[37],"output":[40,320,390],"from":[42,143,150,216,298,311],"complex":[47,63,178,275],"topology":[48,64,69,179,276,349,386],"(iii)":[49],"procedure":[51,229,330],"threshold":[55,334,354],"rate":[57,288,304,336,356,392],"reliability":[58,337],"(iv)":[65],"method":[67,381,404],"(v)":[76],"an":[77],"efficient":[78,158],"algorithm":[79,159,412],"maximizing":[81,301],"in":[84,94,106,174,199,289,363,429],"non-reconfigurable":[85,109,190],"flows.":[90,196],"Maximizing":[91],"static":[96],"network":[98,111,176,203,291,344,385,418],"does":[99],"not":[100],"necessarily":[101],"guarantee":[102],"that":[103],"corresponding":[108],"will":[112],"be":[113,208,264],"maximized.":[114],"In":[115],"this":[116],"respect,":[117],"we":[118,376],"introduce":[119],"new":[121,379],"concept":[122],"related":[123],"to":[124,153,219],"networks:":[127],"`a":[128],"specific":[129,242],"path'":[134],"which":[135],"is":[136,338,359,405],"essentially":[137],"average":[139,226,238,256],"percentage":[140],"losses":[142],"component":[144,294,307],"failures":[145],"source":[152],"sink.":[155],"A":[156,266],"very":[157,361],"based":[160,406],"on":[161,407],"adjacency":[162],"arrays":[163],"has":[164,277],"also":[165,278,360],"been":[166,279],"proposed":[167,282],"all":[170],"minimal":[171],"paths":[173,215,262],"cycles.":[181],"formulate":[183],"prove":[185],"fundamental":[187],"about":[189],"The":[197,228,281,327,402],"can":[207,263],"maximized":[209],"preferentially":[211],"saturating":[212,247],"directed":[213,250],"sources":[218],"sink,":[221],"characterized":[222,350],"largest":[225,237,255,353],"availability.":[227],"starts":[230],"availability":[239,257],"(the":[240],"smallest":[241],"resistance),":[243],"continues":[245],"unsaturated":[249],"until":[258],"no":[259],"more":[260],"saturated.":[265],"reconfigurable":[270],"constructed.":[280],"maximizes":[285],"upon":[292,305],"each":[293,306],"failure":[295,308],"return":[297,310],"repair.":[299],"By":[300],"repair,":[312],"ensures":[316],"larger":[318],"total":[319],"during":[322],"specified":[324,396],"time":[325],"interval.":[326],"designed":[328],"simulation":[329],"particularly":[339],"useful":[340,362],"comparing":[342],"topologies,":[345],"selecting":[347],"reliability.":[357],"It":[358],"deciding":[364],"whether":[365],"resources":[367],"allocated":[368],"purchasing":[370],"extra":[371],"redundancy":[372],"are":[373],"justified.":[374],"Finally,":[375],"combining":[387],"attained":[393],"within":[394],"budget":[397],"building":[399],"network.":[401,432],"branch":[409],"bound":[411],"combined":[413],"pruning":[415],"full-complexity":[417,431],"as":[419],"way":[421],"exploring":[423],"possible":[425],"embedded":[428]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-10T00:00:00"}